Title :
Improving the time resolution of schedules generated via Lagrangian relaxation algorithms
Author :
Owens, Thomas A. ; Luh, Peter B.
Author_Institution :
Dept. of Electr. & Syst. Eng., Connecticut Univ., Storrs, CT, USA
Abstract :
A method is presented which enables relaxation algorithms to efficiently consider fractional utilization of larger time blocks, and thus quickly resolve the schedule into increments that match the precision of the known processing times. Although demonstrated here to be effective on the complicated job shop scheduling problem, the method can easily be extended to other manufacturing environments
Keywords :
computational complexity; production control; scheduling; Lagrangian relaxation algorithms; complicated job shop scheduling problem; fractional utilization; manufacturing environments; processing times; schedule time resolution; Cost function; Job shop scheduling; Lagrangian functions; Machining; Manufacturing; Optimal scheduling; Processor scheduling; Research and development; Scheduling algorithm; Systems engineering and theory;
Conference_Titel :
Systems, Man and Cybernetics, 1992., IEEE International Conference on
Conference_Location :
Chicago, IL
Print_ISBN :
0-7803-0720-8
DOI :
10.1109/ICSMC.1992.271589
