Heuristics for Unrelated Parallel Machine Scheduling with Secondary Resource Constraints

TLDR: In this research heuristics based on guided search, record-to-record travel, and tabu lists from the tabu search (TS) are presented to minimize the maximum completion time (i.e., makespan or Cmax) and maximum tardiness, respectively, to promote schedule performance.

Abstract: This research deals with the problem of scheduling N jobs on M unrelated parallel machines. Each job has a due date and requires a single operation. A setup that includes detaching one die and attaching another from the appropriate die type is incurred if the type of the job scheduled is different from the last job on that machine. Due to the mechanical structure of machines and the fitness of dies to each, the processing time for a job depends on the machine on which the job is processed, and some jobs are restricted to be processed on certain machines. Furthermore, the required detaching and attaching times depend on both the die type and the machine. This type of problems may be encountered, for example, in plastics forming industry where unrelated parallel machines are used to process different components and setups for auxiliary equipment (e.g., dies) are necessary. This type of scheduling problems is also frequently encountered in injection molding departments where many different parallel machines are also used to produce different components and for which setups are required for attaching or detaching molds. In general, the dies (or molds) are quite expensive (tens of thousands dollars each) and thus the number of each type of dies available is limited. Therefore, dies should be considered as secondary resources, the fact of which distinguishes this research from many past studies in unrelated parallel-machine scheduling in which secondary resources are not restricted. This type of problems is NP-hard (So, 1990). When dealing with a large instance encountered in industry, in the worst case, it may not be able to obtain an optimal solution in a reasonable time. In this research heuristics based on guided search, record-to-record travel, and tabu lists from the tabu search (TS) are presented to minimize the maximum completion time (i.e., makespan or Cmax) and maximum tardiness (i.e., Tmax), respectively, to promote schedule performance. Computational characteristics of the proposed heuristics are evaluated through extensive experiments. The rest of this research is organized in six sections. Previously related studies on parallel machine scheduling are reviewed in Section 2. The record-to-record travel and tabu lists are briefly described in Section 3. The proposed heuristic to minimize makespan and the computational results are reported in Section 4. The proposed heuristic to minimize maximum tardiness and the computational results are reported in Section 5. Conclusions and suggestions for future research are discussed in Section 6. O pe n A cc es s D at ab as e w w w .ite ch on lin e. co m