Scheduling jobs on parallel machines applying neural network and heuristic rules

Computers and Industrial Engineering

Volumn 38, Issue 1, 2000, Pages 189-202

  Park, Youngshin ^a   Kim, Sooyoung ^a   Lee, Young Hoon ^b  

^a Pohang University of Science and Technology (POSTECH)   (South Korea)

^b Yonsei University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

CURVE FITTING; HEURISTIC METHODS; NEURAL NETWORKS;

PARALLEL MACHINES;

SCHEDULING;

EID: 0033717569     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0360-8352(00)00038-3     Document Type: Article

References (9)

1. Carroll, D. C. (1965). Heuristic sequencing of jobs with single and multiple components. Ph.D. thesis. Sloan School of Management, MIT.
2. Elvers D.A., Taube L.R. Time completion for various dispatching rules in job shops. OMEGA. 11:(1):1983;81-89.
3. Kim S.Y., Lee Y.H., Agnihotri D. A hybrid approach to sequencing jobs using heuristic rules and neural network. Production Planning and Control. 6:(5):1995;445-454.
4. Lee Y.H., Bhaskaran K., Pinedo M. A heuristic to minimize the total weighted tardiness with sequence-dependent setups. IIE Transactions. 29:1997;45-52.
5. Lee, Y. H., & Pinedo, M. (1992). Scheduling jobs on parallel machines with sequence-dependent setup times. Technical report, Columbia University.
6. Morton T., Lawrence S.R., Rajagopolan S., Kekre S. SCHED-STAR: a price-based shop scheduling module. Journal of Manufacturing and Operations Management. 1:1988;131-181.
7. Raman N., Rachamadugu R.V., Talbot F.B. Real-time scheduling of an automated manufacturing center. European Journal of Operations Research. 40:1989;222-242.
8. Ow P.S., Morton T. The single machine early/tardy problems. Management Science. 35:1989;177-191.
9. Vepsalainen A., Morton T. Priority rules for job shops with weighted tardiness costs. Management Science. 33:1987;1035-1047.