Unrelated parallel machine scheduling with secondary resource constraints

This paper considers unrelated parallel machine scheduling with secondary resource constraints. There are n jobs, each needing to be processed on one of the fitted machines. A setup that includes detaching one die and attaching another from the fitted die type is incurred if the type of job scheduled is different from the last job on that machine. For each kind of die type, the number of dies available is limited. Due to the mechanical structure of the machines, the processing time of a job depends on the machine on which the job is processed, and some jobs are restricted to be processed only on certain machines. In this paper, a heuristic with a capability relative to a runtime and solution quality is developed to minimise the makespan. The performance of the presented heuristic is evaluated through extensive computational experiments. Computational results show that the presented heuristic outperforms the search method tested. It is expected that this research can be applied in industry where unrelated parallel machines are used to process different components and setups for auxiliary equipments are required.

[1]  Frank Ruskey,et al.  Some Optimum Algorithms for Scheduling Problems with Changeover Costs , 1987, Oper. Res..

[2]  Laureano F. Escudero,et al.  On modelling the maximum workload allocation for parallel unrelated machines with setups , 1993, Ann. Oper. Res..

[3]  Kut C. So,et al.  Some heuristics for scheduling jobs on parallel machines with setups , 1990 .

[4]  Nagraj Balakrishnan,et al.  Early/tardy scheduling with sequence dependent setups on uniform parallel machines , 1999, Comput. Oper. Res..

[5]  Gabriel R. Bitran,et al.  Sequencing production on parallel machines with two magnitudes of sequence dependent setup costs , 1989 .

[6]  R. A. Holmes,et al.  On the Use of A Vehicle Routing Algorithm for the Parallel Processor Problem with Sequence Dependent Changeover Costs , 1977 .

[7]  Young Hoon Lee,et al.  Scheduling jobs on parallel machines applying neural network and heuristic rules , 2000 .

[8]  Meral Azizoglu,et al.  Dynamic programming algorithms for scheduling parallel machines with family setup times , 2001, Comput. Oper. Res..

[9]  R. Sumichrast,et al.  Scheduling parallel processors: An integer linear programming based heuristic for minimizing setup time , 1987 .

[10]  Ali Allahverdi,et al.  Scheduling on M parallel machines subject to random breakdowns to minimize expected mean flow time , 1994 .

[11]  Hochang Lee,et al.  A Hybrid Bounding Procedure for the Workload Allocation Problem on Parallel Unrelated Machines with Setups , 1996 .

[12]  Christopher S. Tang.  Scheduling batches on parallel machines with major and minor set-ups , 1990 .

[13]  Arthur M. Geoffrion,et al.  Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach , 1976, Oper. Res..

[14]  T.C.E. Cheng,et al.  A state-of-the-art review of parallel-machine scheduling research , 1990 .

[15]  Hisashi Tamaki,et al.  Application of search methods to scheduling problem in plastics forming plant: a binary representation approach , 1993, Proceedings of 32nd IEEE Conference on Decision and Control.

[16]  Reha Uzsoy,et al.  Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times. , 1995 .

[17]  Funda Sivrikaya-Serifoglu,et al.  Parallel machine scheduling with earliness and tardiness penalties , 1999, Comput. Oper. Res..

[18]  John Lu,et al.  Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective , 2001 .

[19]  A. Guinet.  Scheduling sequence-dependent jobs on identical parallel machines to minimize completion time criteria , 1993 .

[20]  G. Dueck.  New optimization heuristics , 1993 .

[21]  Clyde L. Monma,et al.  Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times , 1993, Oper. Res..