Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs

Naval Research Logistics

Volumn 44, Issue 3, 1997, Pages 287-299

  Federgruen, Awi ^a   Mosheiov, Gur ^b  

^a Och Spine at New York Presbyterian Hospitals   (United States)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COSTS; HEURISTIC METHODS; OPERATIONS RESEARCH; OPTIMIZATION; PROBABILITY; PROBLEM SOLVING; SCHEDULING;

EARLINESS COST; LOWER BOUNDS; MULTIMACHINE MINMAX SCHEDULING PROBLEM; TARDINESS COST;

PRODUCTION CONTROL;

EID: 0031117556     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6750(199704)44:3<287::AID-NAV4>3.0.CO;2-4     Document Type: Article

References (17)

1. Cheng, T.C.E., "Minimizing the Maximum Deviation of Job Completion Time about a Common Due-Date," Computers and Mathematics with Applications, 14, 279-283 (1987).
2. Cheng, T.C.E., and Chen, Z.L., "Parallel-Machine Scheduling Problems with Earliness and Tardiness Penalties," Journal of the Operational Research Society, 45, 685-695 (1994).
3. Chhajed, D., "A Note on 'Minimizing the Maximum Deviation of Job Completion Time about a Common Due Date,'" Applied Mathematics Letters, 1, 161-163 (1988).
4. Coffman, E.G., Garey, M.R., and Johnson, D.S., "An Application of Bin-Packing to Multiprocessor Scheduling," SIAM Journal of Computing, 7, 1-17 (1978).
5. Coffman, E.G., and Lueker, G., Probabilistic Analysis of Packing and Partitioning Algorithms, Wiley, New York, 1991.
6. Federgruen, A., and Mosheiov, G., "Simultaneous Optimization of Efficiency and Performance Balance Measures in Single Machine Scheduling Problems," Naval Research Logistics, 40, 951-970 (1993).
7. Federgruen, A., and Mosheiov, G., "Heuristics for Multi-Machine Scheduling Problems with Earliness and Tardiness Costs," Management Science 42, 1544-1556 (1996).
8. Frenk, J.B.G., and Rinnooy Kan, A.H.G., "The Asymptotic Optimality of the LPT Rule," Mathematics of Operations Research, 12, 241-254 (1987).
9. Friesen, D., and Langston, M., "Evaluation of a MULTIFIT-Based Scheduling Algorithm," Journal of Algorithms, 7, 35-59 (1986).
10. Garey, M., Tarjan, R., and Wilfong, G., "One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties," Mathematics of Operations Research, 13, 333-348 (1988).
11. Karmarkar, N., and Karp, R., "The Differencing Method of Set Partitioning," Report No. UCB/CSD 82/113, Computer Science Division, University of California, Berkeley, 1982.
12. Kubiak, W., Lou, S., and Sethi, S., "Equivalence of Mean Flow Time Problems and Mean Absolute Deviation Problems," Operations Research Letters, 9, 371-374 (1990).
13. Lakshminarayan, S., Lakshmanan, R., Papineau, R., and Rochette, R., "Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties," Operations Research, 26, 1079-1082 (1978).
14. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., and Shmoys, D.B., "Sequencing and Scheduling: Algorithm and Complexity," in Handbooks in OR and MS, Vol. 4: Logistics of Production and Inventory (Eds S. Graves, A. Rinnooy Kan, and P. Zipkin) (1993).
15. Li, C.L., and Cheng, T.C.E., "The Parallel Machine Min-Max Weighted Absolute Lateness Scheduling Problem," Naval Research Logistics, 41, 33-46 (1994).
16. Sidney, J., "Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties," Operations Research, 25, 62-69 (1977).
17. Tuekolsky, S., Vetterling, W., and Flannery, B., Numerical Recipes in C: The Art of Scientific Computing, Cambridge University Press, Cambridge, 1992.