DocumentCode :
3227023
Title :
Time lower bound for manufacturing aggregate scheduling problems
Author :
Chen, C. L Philip
Author_Institution :
Dept. of Comput. Sci. & Eng., Wright State Univ., Dayton, OH, USA
fYear :
1991
fDate :
9-11 Apr 1991
Firstpage :
830
Abstract :
Time lower bound for aggregate tasks scheduling problems is discussed. Aggregate precedence tasks are first preassigned to be processed by the machines. The machines can execute the only aggregate tasks preassigned to them. Job-shop or flow-shop scheduling problems are special simple examples of scheduling problems. Time lower bounds are proposed to estimate the minimum finishing time of an optimal aggregate schedule. Based on the earliest and latest load density functions of tasks preassigned to machines, the proposed methods investigate the delay caused by tasks clustered effect and chain effect. Several algorithms are proposed to obtain the correct time lower bound. An application of the proposed time lower bounds to aggregate scheduling a flexible manufacturing system consisting of machining and assembly machines is discussed. The effectiveness of the proposed time lower bound can be seen from several examples
Keywords :
flexible manufacturing systems; minimisation; production control; assembly; earliest load density functions; flexible manufacturing system; flow shop; job shop; latest load density functions; machining; manufacturing aggregate scheduling; minimisation; precedence tasks; production control; tasks scheduling; time lower bound; Aggregates; Computer science; Density functional theory; Finishing; Job shop scheduling; Lagrangian functions; Linear programming; Manufacturing; Optimal scheduling; Processor scheduling;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Robotics and Automation, 1991. Proceedings., 1991 IEEE International Conference on
Conference_Location :
Sacramento, CA
Print_ISBN :
0-8186-2163-X
Type :
conf
DOI :
10.1109/ROBOT.1991.131690
Filename :
131690
Link To Document :
بازگشت