Generalized two-machine flowshop scheduling problem with processing time linearly dependent on job waiting-time

Computers and Industrial Engineering

Volumn 36, Issue 2, 1999, Pages 365-378

  Yang, Dar Li ^a   Chern, Maw Sheng ^b  

^a NAN KAI UNIVERSITY OF TECHNOLOGY   (Taiwan)

^b NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; GENETIC ALGORITHMS; HEURISTIC METHODS; INTEGER PROGRAMMING; MACHINERY; OPTIMIZATION; QUEUEING THEORY;

HERISTIC ALGORITHM; JOB WAITING TIME; MIXED INTEGER PROGRAM; TWO MACHINE FLOWSHOP SCHEDULING PROBLEM;

SCHEDULING;

EID: 0032592162     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0360-8352(99)00137-0     Document Type: Article

References (7)

1. Chern M-S., Yang D-L. On the two-machine flowshop scheduling problems with processing time linearly dependent on job waiting-time. The Eighteenth International Conference on Computers and Industrial Engineering. Shanghai. 1995.
2. Garey M.R., Johnson D.S. Computers and intractability: a guide to the theory of NP-completeness. 1979;Freeman, San Francisco.
3. Hodson A., Muhlemann A.P., Price D.H.R. A microcomputer based solution to a practical scheduling problem. J Opl Res Soc. 36:1985;903-914.
4. Kunnathur A.S., Gupta S.K. Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem. Eur J Opl Res. 47:1990;56-64.
5. Reddi S., Ramamoorthy C. On the flowshop sequencing problem with no-wait in process. Opl Res Q. 23:1972;323-332.
6. Sriskandarajah C., Goyal S.K. Scheduling of a two-machine flowshop with processing time linearly dependent on job waiting-time. J Opl Res Soc. 40:1989;907-921.
7. Yang D-L., Chern M-S. A two-machine flowshop sequencing problem with limited waiting time constraints. Computers Ind Engng. 28:1995;63-70.