A new class of scheduling criteria and their optimization

 Access to full text

 Full (PDF)

1. R. H. AHMADI and U. BAGCHI, Lower Bounds for Single-Machine Scheduling Problems, Nav. Res. Logist., 1990, 37, pp. 967-979. Zbl0722.90033MR1079884
2. K. R. BAKER, Introduction to Sequencing and Scheduling, John Wiley & Sons, New York, 1974. 
3. K. R. BAKER and J. W. M. BERTRAND, A Dynamic Priority Rule for Scheduling Against Due-Dates, J. Opns. Man., 1982, 5, pp. 37-42. 
4. K. R. BAKER and L. E. SCHRAGE, Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks, Opns. Res., 1978, 26, pp. 111-120. Zbl0376.90055
5. K. R. BAKER and Z. SU, Sequencing with Due-Dates and Early Start Times to Minimize Maximum Tardiness, Nav. Res. Logist. Quart., 1974, 21, pp. 171-176. Zbl0277.90044MR343892
6. H. BELOUADAH, M. E. POSNER and C. N. POTTS, Scheduling with Release Dates on a Single Machine to Minimize Total Weighted Completion Time, Disc. Applied Math., 1992, 36, pp. 213-232. Zbl0757.90032MR1167506
7. L. BIANCO and S. RICCIARDELLI, Scheduling of a Single Machine to Minimize Total Weighted Completion Time Subject to Release Dates, Nav. Res. Logist Quart., 1982, 26, pp. 111-126. Zbl0539.90044
8. P. BRATLEY, M. FLORIAN and P. ROBILLARD, On Scheduling with Earliest Start and Due Dates with Application to Computing Bounds for the (n/m/G/Fmax) Problem, Nav. Res. Logist. Quart., 1973, 20, pp. 57-67. Zbl0256.90027MR411599
9. J. CARLIER, The One Machine Sequencing Problem. Europ. J. Oper. Res., 1982, 11, pp. 42-47. Zbl0482.90045MR671798
10. R. CHANDRA, On n/1/F Dynamic Deterministic Systems, Nav. Res. Logist Quart., 1979, 39, pp. 265-283. Zbl0496.90044
11. C. CHU, A Branch-and-Bound Algorithm to Minimize Total Tardiness with Different Release Dates, Nav. Res. Logist., 1992a, 39, pp. 265-283. Zbl0762.90035MR1178859
12. C. CHU, A Branch-and-Bound Algorithm to Minimize Total Flow Time with Unequal Release Dates, Nav. Res. Logist., 1992b, 39, pp. 859-875. Zbl0766.90039MR1178859
13. C. CHU, Efficient Heuristics to Minimize Total Flow Time with Release Dates, Operations Research Letters, 1992c, 12, pp. 321-330. Zbl0769.90047MR1189736
14. C. CHU, Scheduling to Minimize Over-Regular Criteria, Rapport de Recherche No. 1704, INRIA, Rocquencourt, France, 1992d. 
15. C. CHU and R. W. CONWAY, W. L. MAXWELL and L. W. MILLER, Theory of Scheduling, Addison-Wesley, Reading, MA, 1967. Zbl1058.90500MR389180
16. J. S. DEOGUN, On Scheduling with Ready Times to Minimize Mean Flow Time, The Computer Journal, 1983, 26, pp. 320-328. Zbl0523.68029MR741903
17. M. I. DESSOUKY and J. S. DEOGUN, Scheduling Jobs with Unequal Ready Times to Minimize Mean Flow Time, SIAM Journal of Computing, 1981, 10, pp. 192-202. Zbl0454.68010MR605612
18. M. I. DESSOUKY and C. R. MARGENTHALER, The One-Machine Sequencing Problem with Early Starts and Due Dates, AIIE Transactions, 1972, 4, pp. 214-222. 
19. J. DU and J. Y.-T. LEUNG, Minimizing Total Tardiness on One Machine is NP-hard. Math. Opns. Res., 1990, 75, pp. 483-495. Zbl0714.90052MR1064213
20. H. EMMONS, One-Machine Sequencing to Minimize Certain Functions of Job Tardiness, Opns. Res., 1969, 17, pp. 701-715. Zbl0176.50005MR243826
21. M. L. FISHER, A Dual Algorithm for the One-Machine Scheduling Problem, Math. Prog., 1976, 11, pp. 229-251. Zbl0359.90039MR496610
22. S. FRENCH, Sequencing and Scheduling: An introduction to the Mathematics of the Job-Shop, John Wiley & Sons, New York, 1982. Zbl0479.90037MR642978
23. J. GRABOWSKI, E. NOWICKI and S. ZDRZALKA, A Block Approach for Single-Machine Scheduling with Release Dates and Due Dates, Europ. J. Oper. Res., 1986, 26, pp. 278-285. Zbl0603.90073MR852298
24. N. G. HALL, Scheduling Problems with Generalized Due Dates, IIE Transactions, 1986, 18, pp. 220-222. 
25. N. G. HALL and W. T. RHEE, Average and Worst-Case Analysis of Heuristics for the Maximum Tardiness Problem, Europ. J. Oper. Res., 1986, 26, pp. 272-277. Zbl0599.90054MR852297
26. N. G. HALL, S. P. SETHI and C. SRISKANDARAJAH, On the Complexity of Generalized Due Date Scheduling Problems, Europ. J Opnl Res., 1991, 57, pp. 100-109. Zbl0742.90043
27. A. M. A. HARIRI and C. N. POTTS, An Algorithm for Single Machine Sequencing with Release Dates to Minimize Total Weighted Completion Time, Discr. Appl. Math., 1983, 5, pp. 99-109. Zbl0498.90044
28. J. R. JACKSON, Scheduling a Production Line to Minimize Maximum Tardiness, Research Report, 1955, 43, Management Science Research Project, University of California, Los Angeles. 
29. B. J. LAGEWEG, J. K. LENSTRA and A. H. G. RINNOOY KAN, Minimizing Maximum Lateness on One Machine: Computational Expérience and Some Applications, Statist. Neerlandica, 1976, 30, pp. 25-41. Zbl0336.90029MR434397
30. R. E. LARSON, M. I. DESSOUKY and R. E. DEVOR, A Forward-Backward Procedure for the Single Machine Problem to Minimize Maximum Lateness, IIE Transactions, 1985, 17, pp. 252-260. 
31. E. L. LAWLER, A "Pseudopolynomial" Algorithm for Sequencing Jobs to Minimize Total Tardiness, Ann. Disc. Math., 1977, 1, pp. 331-342. Zbl0353.68071MR456420
32. E. L. LAWLER, A Fully Polynomial Approximation Scheme for the Total Tardiness Problem, Opns. Res.Lett., 1982, 1, pp.207-208. Zbl0511.90074
33. J. LIU and B. L. MACCARTHY, Effective Heuristics for the Single Machine Sequencing Problem with Ready Times, Int. J. Prod. Res., 1991, 29, pp. 1521-1533. Zbl0728.90042
34. G. MCMAHON and M. FLORIAN, On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness, Opns. Res., 1975, 23, pp. 475-482. Zbl0301.90024
35. C. N. POTTS, Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times, Opns. Res., 1980, 28, pp.1436-1441. Zbl0447.90041MR609970
36. C. N. POTTS and L. N. VAN WASSENHOVE, A Decomposition Algorithm for the Single Machine Total Tardiness Problem, Opns. Res. Lett., 1982, 1, pp. 177-181. Zbl0508.90045
37. A. H. G. RINNOOY KAN, Machine Sequencing Problems: Classification, Complexity and Compilation, Nijhoff, The Hague, 1976. 
38. J. SHWIMER, On the n-job, One-Machine, Sequence-Independent Scheduling Problem with Tardiness Penalties: a Branch-and-Bound Solution, Man. Sci., 1972, 18, pp. B301-B313. Zbl0231.90030MR292494
39. V. SRINIVASAN, A Hybrid Algorithm for the One Machine Sequencing Problem to Minimize Total Tardiness, Nav. Res. Logist. Quart., 1971, 18, pp. 317-327. Zbl0229.90029MR307683
40. L. J. WILKERSON and J. D. IRWIN, An Improved Algorithm for Scheduling Independent Tasks, AIIE Transactions, 1971, 3, pp.239-245.