Single machine scheduling problems with general breakdowns, earliness and tardiness costs

Operations Research

Volumn 45, Issue 1, 1997, Pages 66-71

  Federgruen, A ^a   Mosheiov, G ^b  

^a Howard Hughes Medical Institute   (United States)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COST EFFECTIVENESS; OPERATIONS RESEARCH; OPTIMIZATION; PROCESS CONTROL; SCHEDULING;

EQUIVALENT COST FUNCTION;

PRODUCTION CONTROL;

EID: 0030674930     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.45.1.66     Document Type: Article

References (24)

1. BAKER, K., AND G. SCUDDER. 1990. Sequencing with Earliness and Tardiness Penalties: A Review. Opns. Res. 38, 22-36.
2. BIRGE, J., J. FRENK, J. MITTENTHAL AND A. RINNOOY KAN. 1991. Single Machine Scheduling Subject to Stochastic Breakdowns. Naval Res. Logist. 37, 661-677.
3. BRÉMAUD, P. 1981. Point Processes and Queues. Springer Verlag, New York.
4. BROWNE, S., AND K. GLAZEBROOK. 1992. Scheduling Jobs Subject to Contagious Breakdowns. To appear in Naval Res. Logist.
5. FEDERGRUEN, A., AND Z. KATALAN. 1996. The Stochastic Economic Lot Scheduling Problem: Cyclical Base-Stock Policies with Idle Times. Man. Sci. 42, 783-796.
6. FEDERGRUEN, A., AND G. MOSHEIOV. 1993a. Simultaneous Optimization of Efficiency and Performance Balance Measures in Single Machine Scheduling Problems. Naval Res. Logist. 40, 951-970.
7. FEDERGRUEN, A., AND G. MOSHEIOV. 1993b. Scheduling Problems with General Breakdowns, Earliness and Tardiness Costs. Unabridged version of this paper.
8. FEIGIN, P. 1979. On the Characterization of Point Processes with the Order Statistic Property. J. Appl. Prob. 16, 297-304.
9. FORST, F. G. 1993, Stochastic Sequencing on One Machine with Earliness and Tardiness Penalties. Prob. Engr. and Inf. Sci. 7, 291-300.
10. GERBER, H. 1981. An Introduction to Mathematical Risk Theory. Irwin, Homewood, Illinois.
11. GLAZEBROOK, K. 1984. Scheduling Stochastic Jobs on a Single Machine Subject to Breakdowns. Naval Res. Logist. 31, 251-264.
12. GLAZEBROOK, K. 1987. Evaluating the Effects of Machine Breakdowns in Stochastic Scheduling Problems. Naval Res. Logist. 34, 319-355.
13. KAHLBACHER, H. 1992. Scheduling with Monotonous Earliness and Tardiness Penalties. Eur. J. Opnl. Res. 64, 258-277.
14. KRIEGER, A., AND M. RAGHAVACHARI. 1988. Deterministic and Random Single Machine Scheduling with Due Dates and General Penalty Functions. Technical Report, Dept. of Decision Sciences and Engineering Systems, Rensselaer Polytechnic Institute, Troy, New York.
15. MITTENTHAL, J., AND M. RAGHAVACHARI. 1993. Stochastic Single Machine Scheduling with Quadratic Early-tardy Penalties. Opns. Res. 41, 786-796.
16. PINEDO, M. 1984. Optimal Policies in Stochastic Shop Scheduling. In Stochastics and Optimization, F. Archetti and F. Maffioli eds. Anns. Opns. Res. 1, 305-329.
17. PINEDO, M., AND E. RAMMOUZ. 1988. A Note on Stochastic Scheduling on a Single Machine Subject to Breakdown and Repair. Prob. Eng. Inf. Sci. 2, 41-49.
18. RINNOOY KAN, A., AND G. TIMMER. 1989. Global Optimization. Chapter IX in Handbook in Operations Research and Management Science 1. G. Nemhauser, A. Rinnooy Kan and M. Todd (eds.). North Holland, Amsterdam.
19. 1-Martingales in Stochastic Optimization Problems. Math. Prog. Study 6, 170-187. Also in R. Wets (ed.). Stochastic Systems: Modeling, Identification and Optimization. North-Holland, Amsterdam.
20. 1-Martingales in Stochastic Optimization Problems. Math. Prog. Study 6, 170-187. Also in R. Wets (ed.). Stochastic Systems: Modeling, Identification and Optimization. North-Holland, Amsterdam.
21. SHAKED, M., AND G. SHANTIKUMAR. 1994. Stochastic Orders and Their Applications. Academic Press, San Diego, California.
22. SHANTHIKUMAR, G., AND D. VAG. 1992. Spatiotemporal Convexity of Stochastic Processes and Applications. Prob. Engr. and Inf. Sci. 6, 1-16.
23. WALRAND, J. 1988. Introduction to Queneing Networks, Prentice Hall, Englewood Cliffs, New Jersey.
24. WHITT, W. 1981. Comparing Counting Processes and Queues. Adv. Appl. Prob. 13, 207-220.