Single machine scheduling with a variable common due date and resource-dependent processing times

Computers and Operations Research

Volumn 30, Issue 8, 2003, Pages 1173-1185

  Ng Daniel, C T ^a   Cheng, T C Edwin ^a   Kovalyov, Mikhail Y ^b   Lam, S S ^c  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b UNITED INSTITUTE OF INFORMATICS PROBLEMS   (Belarus)

^c OPEN UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Common due date assignment; Controllable processing times; Single machine scheduling

Indexed keywords

ALGORITHMS; COST EFFECTIVENESS; CUSTOMER SATISFACTION; FUNCTIONS; OPTIMIZATION; PERSONAL COMPUTERS; POLYNOMIALS;

MACHINE SCHEDULING;

SCHEDULING;

COMPUTER;

EID: 0037410951     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(02)00066-7     Document Type: Article

References (19)

1. Panwalkar SS, Smith ML, Seidmann A. Common due date assignment to minimize total penalty for the one machine scheduling problem. Operations Research 1982;30:391-9.
2. Cheng TCE. Common due-date assignment and scheduling for a single processor to minimize the number of tardy jobs. Engineering Optimization 1990;16:129-36.
3. Wheelwright SC. Reflecting corporate strategy in manufacturing decisions. Business Horizons 1978;21:57-66.
4. Smith ML, Seidmann A. Due date selection procedures for job-shop simulation. Computers and Industrial Engineering 1983;7:199-207.
5. Ragatz GL, Mabert VA. A framework for the study of due-date management in job shops. International Journal of Production Research 1984;22:685-95.
6. Cheng TCE, Gupta MC. Survey of scheduling research involving due-date determination decisions. European Journal of Operational Research 1989;38:156-66.
7. Baker KR, Scudder GD. Sequencing with earliness and tardiness penalties: a review. Operations Research 1990;38:22-36.
8. Williams TJ. Analysis and design of hierarchical control systems with special reference to steel plant operations. Amsterdam: North-Holland, 1985.
9. Vickson RG. Choosing the job sequence and processing times to minimize total processing plus flow cost on a single machine. Operations Research 1980;28:1155-67.
10. Vickson RG. Two single machine sequencing problems involving controllable job processing times. AIIE Transactions 1980;12:258-62.
11. Van Wassenhove LN, Baker KR. A bicriterion approach to time/cost tradeoffs in sequencing. European Journal of Operational Research 1982;11:48-54.
12. Nowicki E, Zdrzalka S. A survey of results for sequencing problems with controllable processing times. Discrete Applied Mathematics 1990;26:271-87.
13. Janiak A. Time-optimal control in a single machine problem with resource constraints. Automatica 1986;22:745-7.
14. Blazewicz J, Ecker KH, Pesch E, Schmidt G, Weglarz J. Scheduling computer and manufacturing processes. Berlin: Springer, 1996.
15. Janiak A, Portmann M-C. Minimization of the maximum lateness in single machine scheduling with release dates and additional resources. Proceedings of the International Conference on Industrial Engineering and Production Management, Lyon, France, October 20-24, 1997, Book I. pp. 283-92.
16. Chen ZL, Lu Q, Tang G. Single machine scheduling with discretely controllable processing times. Operations Research Letters 1997;21:69-76.
17. Cheng TCE, Oguz C, Qi XD. Due-date assignment and single machine scheduling with compressible processing times. International Journal of Production Economics 1996;43:29-35.
18. Biskup D, Jahnke H. Common due date assignment for scheduling on a single machine with jointly reducible processing times. International Journal of Production Economics 2001;69:317-22.
19. Herstein IN. Topics in algebra, 2nd ed. New York: Wiley, 1975.