DocumentCode :
2571674
Title :
A hybrid scheduling algorithm for multiclass production systems with setup times
Author :
Narahari, Y. ; Srigopal, R.
Author_Institution :
Dept. of Comput. Sci. & Autom., Indian Inst. of Sci., Bangalore, India
fYear :
1994
fDate :
10-12 Oct 1994
Firstpage :
279
Lastpage :
284
Abstract :
Proposes a hybrid algorithm for scheduling non-preemptive, single operation jobs in a multiclass production environment. The objective is to minimize the sum of the total weighted tardiness and setup costs of the schedule. The authors believe the problem is NP hard, and use an efficient suboptimal algorithm based on Lagrangian relaxation and simulated annealing. The authors´ algorithm works well for a variety of scheduling problems
Keywords :
computational complexity; optimisation; production control; relaxation theory; simulated annealing; Lagrangian relaxation; NP hard; hybrid scheduling algorithm; multiclass production systems; nonpreemptive single operation jobs; setup costs; setup times; simulated annealing; suboptimal algorithm; total weighted tardiness; Automation; Computer science; Costs; Job production systems; Job shop scheduling; Lagrangian functions; Processor scheduling; Production systems; Scheduling algorithm; Simulated annealing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Integrated Manufacturing and Automation Technology, 1994., Proceedings of the Fourth International Conference on
Conference_Location :
Troy, NY
Print_ISBN :
0-8186-6510-6
Type :
conf
DOI :
10.1109/CIMAT.1994.389060
Filename :
389060
Link To Document :
بازگشت