Title :
Scheduling on the parallel machines with mould constraint
Author :
Xianzhang, Chen ; Chengyao, Wang
Author_Institution :
Coll. of Inf. Sci. & Eng., Northeastern Univ., Shenyang, China
Abstract :
This paper addresses the problem of scheduling n grouped jobs on m identical parallel machines with objective of minimizing the sum tardiness, subject to the constraints that each model number is only one and has different matching with each machine. A heuristic approach based on list scheduling is presented. Some conditions are presented which can break the sequence of assigning jobs. The results show that it can get a satisfactory solution
Keywords :
heuristic programming; minimisation; moulding; production control; grouped job scheduling; heuristic approach; job assignment; list scheduling; mould constraint; parallel machines; tardiness sum minimization; Educational institutions; Globalization; Group technology; Heuristic algorithms; Information science; Job shop scheduling; Large-scale systems; Parallel machines; Production facilities; Scheduling algorithm;
Conference_Titel :
SICE Annual, 1999. 38th Annual Conference Proceedings of the
Conference_Location :
Morioka
Print_ISBN :
4-907764-13-8
DOI :
10.1109/SICE.1999.788717
