Scheduling stochastic jobs with asymmetric earliness and tardiness penalties

Naval Research Logistics

Volumn 44, Issue 6, 1997, Pages 531-557

  Cai, X ^a   Zhou, S ^b  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Dynamic programming; Earliness tardiness minimization; Fibonnaci search; Stochastic scheduling; V shape properly

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; MATHEMATICAL MODELS; POLYNOMIALS; PROBABILITY; RANDOM PROCESSES; SCHEDULING;

EARLINESS PENALTY; FIBONNACI SEARCH; TARDINESS PENALTY;

LOGISTICS;

EID: 0031234090     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6750(199709)44:6<531::AID-NAV2>3.0.CO;2-4     Document Type: Article

References (36)

1. Ahmed, M., and Sundararghavan, P., "Minimizing the Weighted Sum of Late and Early Completion Penalties in a Single Machine," IIE Transactions, 22, 288-290 (1990).
2. Alidaee, B., Kochenberger, G.A., and Ahmadian, A., "Minimization of Total Absolute Flow Time Deviation in Single and Multiple Machine Scheduling," Journal of the Operational Research Society, 45, 1077-1087 (1994).
3. Bagchi, U., Chang, Y.L., and Sullivan, R.S., "Minimizing Absolute and Squared Deviations of Completion Times with Different Earliness and Tardiness Penalties and a Common Due Date," Naval Research Logistics, 34, 739-751 (1987).
4. Baker, K.R., and Scudder, G.D., "Sequencing with Earliness and Tardiness Penalties: A Review," Operations Research. 38, 22-36 (1990).
5. Balut, S.J., "Scheduling to Minimize the Number of Late Jobs when Set-Up and Processing Times are Uncertain," Management Science, 19, 1283-1288 (1973).
6. Blau, R.A., "N-Job, One Machine Sequencing Problems under Uncertainty," Management Science, 20, 101-109 (1973).
7. Boxma, O.J., and Forst, F.G., "Minimizing the Expected Weighted Number of Tardy Jobs in Stochastic Flow Shops," Operations Research Letters, 5, 119-126 (1986).
8. Cai, X., and Zhou, S., "Sequencing Jobs with Random Processing Times to Minimize Weighted Completion Time Variance," Annals of Operations Research (Special Volume on Scheduling Theory and Applications) (to be published).
9. Cheng, T.C.E., "Optimal Due-Date Assignment for a Single Machine Sequencing Problem with Random Processing Times," International Journal of Systems Science, 17, 1139-1144 (1986).
10. Cheng, T.C.E., "Optimal Due-Date Determination and Sequencing with Random Processing Times," Mathematical Modelling, 9, 573-576 (1987).
11. Chakravarthy, S., "A Single Machine Scheduling Problem with Random Processing Times," Naval Research Logistics, 33, 391-397 (1986).
12. Crabill, T.B., and Maxwell, W.L., "Single Machine Sequencing with Random Processing Times and Random Due Dates," Naval Research Logistics Quarterly, 19, 549-554 (1969).
13. De, P., Ghosh, J.B., and Wells, C.E., "On the Minimization of the Weighted Number of Tardy Jobs with Random Processing Times and Deadline," Computers and Operations Research, 18, 457-463 (1991).
14. Eilon, S., and Chowdhury, I.G., "Minimizing Waiting Time Variance in the Single Machine Problem," Management Science, 23, 567-575 (1977).
15. Emmons, H., "Scheduling to a Common Due Date on Parallel Common Processors," Naval Research Ligistics, 34, 803-810 (1987).
16. Erel, E., and Sarin, S.C., "Scheduling Independent Jobs with Stochastic Processing Times and a Common Due Date on Parallel and Identical Machines," Annals of Operations Research, 17, 181-198 (1989).
17. 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).
18. Fry, T.D., Armstrong, R.D., and Blackstone, J.H., "Minimizing Weighted Absolute Deviation in Single Machine Scheduling," IIE Transactions, 19, 445-450 (1987).
19. Hall, N., and Posner, M.E., "Earliness-Tardiness Scheduling Problems. I: Weighted Deviation of Completion Times about a Common Due Date," Operations Research, 39, 836-846 (1991).
20. Hall, N., Kubiak, W., and Sethi, S.P., "Earliness-Tardiness Scheduling Problems. II: Deviation of Completion Times about a Restrictive Common Due Date," Operations Research, 39, 847-856 (1991).
21. Kanet, J.J., "Minimizing Variation of Flow Time in Single Machine Systems," Management Science, 27, 1453-1459 (1981).
22. Kise, H., and Ibaraki, T., "On Balut's Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem," Management Science, 29, 384-388 (1983).
23. Lee, C.-Y., Danusaputro, S.L., and Lin, C.-S., "Minimizing Weighted Number of Tardy Jobs and Weighted Earliness-Tardiness Penalties about a Common Due Date," Computers and Operations Research, 18, 379-389 (1991).
24. Luenberger, D.G., Linear and Nonlinear Programming (2nd ed.), Addison-Wesley, Reading, MA, 1984.
25. McGee, G.R., and Webster, D.B., "An Investigation of a Two-Stage Production Line with Normally Distributed Interarrival and Service Time Distributions," International Journal of Production Research, 14, 251-261 (1976).
26. Mittenthal, J., and Raghavachari, M., "Stochastic Single Machine Scheduling with Quadratic Early-Tardy Penalties," Operations Research. 41, 786-796 (1993).
27. Panwalkar, S., Smith, M., and Seidmann, A., "Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem," Operations Research, 30, 391-399 (1982).
28. Pinedo, M., "Stochastic Scheduling with Release Dates and Due Dates," Operations Research, 31, 559-572 (1983).
29. Sarin, S.C., Erel, E., and Steiner, "Sequencing Jobs on a Single Machine with a Common Due Date and Stochastic Processing Times," European Journal of Operational Research, 51, 287-302 (1991).
30. Sundararghavan, P., and Ahmed, M., "Minimizing the Sum of Absolute Lateness in Single Machine and Multimachine Scheduling," Naval Research Logistics, 31, 325-333 (1984).
31. Soroush, H.M., and Fredendall, L.D., "The Stochastic Single Machine Scheduling Problem with Earliness and Tardiness Costs," European Journal of Operational Research, 77, 287-302 (1994).
32. Szwarc, W., "Single Machine Scheduling to Minimize Absolute Deviation of Completion Time from a Common Due Date," Naval Research Logistics, 36, 663-673 (1989).
33. Vani, V., and Raghavachari, M., "Deterministic and Random Single Machine Sequencing with Variance Minimization," Operations Research, 35, 111-120 (1987).
34. Wilhelm, W.E., "On the Normality of Operation Times in Small-Lot Assembly Systems: A Technical Note," International Journal of Production Research, 25, 145-149 (1987).
35. Wilhelm, W.E., and Ahmadi-Marandi, S., "A Methodology to Describe Operating Characteristics of Assembly Systems," IIE Transactions, 14, 204-213 (1982).
36. Yano, C. A., and Kim, Y.-D., "Algorithms for a Class of Single-Machine Tardiness and Earliness Problems," European Journal of Operational Research, 52, 167-178 (1991).