Heuristics for multimachine scheduling problems with earliness and tardiness costs

Management Science

Volumn 42, Issue 11, 1996, Pages 1544-1555

  Federgruen, A ^a   Mosheiov, G ^a  

^a NONE

Author keywords

Asymptotic and Probabilistic Analysis; Earliness and Tardiness Costs; Heuristics; Multimachine Scheduling; Worst Case

Indexed keywords

EID: 0001155594     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.42.11.1544     Document Type: Article

References (27)

1. Bagchi, U., R. Sullivan, and Y. Chang, "Minimizing Mean Squared Deviation of Completion Time about a Common Due Date," Management Sci., 33 (1987), 894-906.
2. Baker, K. and G. Scudder, "Sequencing with Earliness and Tardiness Penalties: A Review," Oper. Res., 38, 1 (1990), 22-36.
3. Blackburn, J., "Time-Base Competition: The Next Battleground in American Manufacturing," Irwin, Homewood, IL, 1991.
4. De, P., J. Ghosh, and C. Wells, "On the Minimization of Completion Time Variance with a Bio Extension," Oper. Res., 40 (1992), 1148-1155.
5. _, _, and _, "A Note on the Minimization of Mean Squared Deviation of Completion Times about a Common Due Date," Management Sci., 35 (1989), 1143-1147.
6. Eilon, S. and I. Chowdhury, "Minimizing Waiting-time Variance in the Single Machine Problem," Management Sci., 23 (1977), 567-575.
7. Emmons, H., "Scheduling to a Common Due Date on Parallel Common Processors," Naval Res. Logistics Quarterly, 34 (1987), 803-810.
8. Federgruen, A. and G. Mosheiov, "Simultaneous Optimization of Efficiency and Performance Balance Measures in Single Machine Scheduling Problems," Naval Res. Logistics Quarterly, 40 (1993), 951-970.
9. _ and _, "Heuristics for Multi-Machine Scheduling Problems with Earliness and Tardiness Costs," Working Paper, Graduate School of Business, Columbia University, New York (unabridged version of this paper), 1994.
10. Gupta, M., K. Gupta, and C. Bector, "Minimizing the Flow-time Variance in Single-Machine Systems," J. Opl. Res. Soc., 41 (1990), 767-779.
11. Hall, N., "Single- and Multiple-processor Models for Minimizing Completion-time Variance," Naval Res. Logistics Quarterly, 33 (1986), 49-54.
12. Hall, R., Zero Inventories, Dow Jones-Irwin, Homewood, IL, 1983.
13. _ and W. Kubiak, "Proof of a Conjecture of Schrage about the Completion Time Variance Problem," Oper. Res. Letters, 10 (1991), 467-472.
14. _, _, and S. Sethi, "Deviation of Completion Times about a Restrictive Common Due Date," Oper. Res., 39 (1991), 847-856.
15. Jozefowska, J. and W. Kubiak, "Spectral Algorithms for the Completion Time Variance Problems," Working Paper, Faculty of Business Administration, Memorial University of Newfoundland, St. John, Newfoundland, 1993.
16. Kanet, J., "Minimizing the Average Deviation of Job Completion-times about a Common Due-date," Naval Res. Logistics Quarterly, 28 (1981), 643-651.
17. Kahlbacher, H., "Scheduling with Monotonous Earliness and Tardiness Penalties," European J. Oper. Res., 64 (1992), 258-277.
18. Kubiak, W., S. Low, and S. Sethi, "Equivalence of Mean Flow Time Problems and Mean Absolute Deviation Problems," Oper. Res. Letters, 9 (1990), 371-374.
19. _, "Completion Time Variance Minimization on a Single Machine is Difficult," Oper. Res. Letters, 14 (1993b), 49-59.
20. _, "New Results on the Completion Time Variance Minimization," to appear in Discrete Applied Mathematics.
21. Merten, A. and M. Muller, "Variance Minimization in Single Machine Sequencing Problems," Management Sci., 18 (1972), 518-528.
22. Monden, Y., Toyota Production System, Institute of Industrial Engineering Press, Norcross, GA, 1983.
23. Mosheiov, G., "Scheduling Problems with Earliness and Tardiness Costs; A Just-in-Time Approach," Ph.D. Dissertation, Columbia University, New York, 1991.
24. Schrage, L., "Minimizing the Time-in-system Variance for a Finite Jobset," Management Sci., 21 (1975), 540-543.
25. Sundararaghavan, P. and M. Ahmed, "Minimizing the Sum of Absolute Lateness in Single-machine and Multi-machine Scheduling," Naval Res. Logistics Quarterly, 31 (1984), 325-333.
26. Vani, V. and M. Raghavachari, "Deterministic and Random Single Machine Sequencing with Variance Minimization," Oper. Res., 35 (1987), 111-120.
27. Ventura, J. and X. Weng, "Minimizing the Single-Machine Completion Time Variances," to appear in Management Sci.