@article{RO_1996__30_2_171_0, author = {Chu, Chengbin}, title = {A new class of scheduling criteria and their optimization}, journal = {RAIRO - Operations Research - Recherche Op\'erationnelle}, pages = {171--189}, publisher = {EDP-Sciences}, volume = {30}, number = {2}, year = {1996}, zbl = {0868.90063}, language = {en}, url = {http://archive.numdam.org/item/RO_1996__30_2_171_0/} }
TY - JOUR AU - Chu, Chengbin TI - A new class of scheduling criteria and their optimization JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 1996 SP - 171 EP - 189 VL - 30 IS - 2 PB - EDP-Sciences UR - http://archive.numdam.org/item/RO_1996__30_2_171_0/ LA - en ID - RO_1996__30_2_171_0 ER -
Chu, Chengbin. A new class of scheduling criteria and their optimization. RAIRO - Operations Research - Recherche Opérationnelle, Tome 30 (1996) no. 2, pp. 171-189. http://archive.numdam.org/item/RO_1996__30_2_171_0/
Lower Bounds for Single-Machine Scheduling Problems, Nav. Res. Logist., 1990, 37, pp. 967-979. | MR | Zbl
and ,Introduction to Sequencing and Scheduling, John Wiley & Sons, New York, 1974.
,A Dynamic Priority Rule for Scheduling Against Due-Dates, J. Opns. Man., 1982, 5, pp. 37-42.
and ,Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks, Opns. Res., 1978, 26, pp. 111-120. | Zbl
and ,Sequencing with Due-Dates and Early Start Times to Minimize Maximum Tardiness, Nav. Res. Logist. Quart., 1974, 21, pp. 171-176. | MR | Zbl
and ,Scheduling with Release Dates on a Single Machine to Minimize Total Weighted Completion Time, Disc. Applied Math., 1992, 36, pp. 213-232. | MR | Zbl
, and ,Scheduling of a Single Machine to Minimize Total Weighted Completion Time Subject to Release Dates, Nav. Res. Logist Quart., 1982, 26, pp. 111-126. | Zbl
and ,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. | MR | Zbl
, and ,The One Machine Sequencing Problem. Europ. J. Oper. Res., 1982, 11, pp. 42-47. | MR | Zbl
,On n/1/F Dynamic Deterministic Systems, Nav. Res. Logist Quart., 1979, 39, pp. 265-283. | Zbl
,A Branch-and-Bound Algorithm to Minimize Total Tardiness with Different Release Dates, Nav. Res. Logist., 1992a, 39, pp. 265-283. | MR | Zbl
,A Branch-and-Bound Algorithm to Minimize Total Flow Time with Unequal Release Dates, Nav. Res. Logist., 1992b, 39, pp. 859-875. | MR | Zbl
,Efficient Heuristics to Minimize Total Flow Time with Release Dates, Operations Research Letters, 1992c, 12, pp. 321-330. | MR | Zbl
,Scheduling to Minimize Over-Regular Criteria, Rapport de Recherche No. 1704, INRIA, Rocquencourt, France, 1992d.
,Theory of Scheduling, Addison-Wesley, Reading, MA, 1967. | MR | Zbl
and , and ,On Scheduling with Ready Times to Minimize Mean Flow Time, The Computer Journal, 1983, 26, pp. 320-328. | MR | Zbl
,Scheduling Jobs with Unequal Ready Times to Minimize Mean Flow Time, SIAM Journal of Computing, 1981, 10, pp. 192-202. | MR | Zbl
and ,The One-Machine Sequencing Problem with Early Starts and Due Dates, AIIE Transactions, 1972, 4, pp. 214-222.
and ,Minimizing Total Tardiness on One Machine is NP-hard. Math. Opns. Res., 1990, 75, pp. 483-495. | MR | Zbl
and ,One-Machine Sequencing to Minimize Certain Functions of Job Tardiness, Opns. Res., 1969, 17, pp. 701-715. | MR | Zbl
,A Dual Algorithm for the One-Machine Scheduling Problem, Math. Prog., 1976, 11, pp. 229-251. | MR | Zbl
,Sequencing and Scheduling: An introduction to the Mathematics of the Job-Shop, John Wiley & Sons, New York, 1982. | MR | Zbl
,A Block Approach for Single-Machine Scheduling with Release Dates and Due Dates, Europ. J. Oper. Res., 1986, 26, pp. 278-285. | MR | Zbl
, and ,Scheduling Problems with Generalized Due Dates, IIE Transactions, 1986, 18, pp. 220-222.
,Average and Worst-Case Analysis of Heuristics for the Maximum Tardiness Problem, Europ. J. Oper. Res., 1986, 26, pp. 272-277. | MR | Zbl
and ,On the Complexity of Generalized Due Date Scheduling Problems, Europ. J Opnl Res., 1991, 57, pp. 100-109. | Zbl
, and ,An Algorithm for Single Machine Sequencing with Release Dates to Minimize Total Weighted Completion Time, Discr. Appl. Math., 1983, 5, pp. 99-109. | Zbl
and ,Scheduling a Production Line to Minimize Maximum Tardiness, Research Report, 1955, 43, Management Science Research Project, University of California, Los Angeles.
,Minimizing Maximum Lateness on One Machine: Computational Expérience and Some Applications, Statist. Neerlandica, 1976, 30, pp. 25-41. | MR | Zbl
, and ,A Forward-Backward Procedure for the Single Machine Problem to Minimize Maximum Lateness, IIE Transactions, 1985, 17, pp. 252-260.
, and ,A "Pseudopolynomial" Algorithm for Sequencing Jobs to Minimize Total Tardiness, Ann. Disc. Math., 1977, 1, pp. 331-342. | MR | Zbl
,A Fully Polynomial Approximation Scheme for the Total Tardiness Problem, Opns. Res.Lett., 1982, 1, pp.207-208. | Zbl
,Effective Heuristics for the Single Machine Sequencing Problem with Ready Times, Int. J. Prod. Res., 1991, 29, pp. 1521-1533. | Zbl
and ,On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness, Opns. Res., 1975, 23, pp. 475-482. | Zbl
and ,Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times, Opns. Res., 1980, 28, pp.1436-1441. | MR | Zbl
,A Decomposition Algorithm for the Single Machine Total Tardiness Problem, Opns. Res. Lett., 1982, 1, pp. 177-181. | Zbl
and ,Machine Sequencing Problems: Classification, Complexity and Compilation, Nijhoff, The Hague, 1976.
,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. | MR | Zbl
,A Hybrid Algorithm for the One Machine Sequencing Problem to Minimize Total Tardiness, Nav. Res. Logist. Quart., 1971, 18, pp. 317-327. | MR | Zbl
,An Improved Algorithm for Scheduling Independent Tasks, AIIE Transactions, 1971, 3, pp.239-245.
and ,