| Summary: | 碩士 === 逢甲大學 === 工業工程學系 === 87 === The unrelated parallel machine scheduling with setups and process restrictions is investigated in this research. There are n jobs, all requiring a single stage of processing, which can be processed on many different machines. Before processing, a setup time is needed to attach a pre-assigned die on the machine. Different jobs may require different die-types and there are finite number of dies of the same die-type. Due to the combination of machine and die-type, the operation time of each job differs from one machine to another and each job is restricted to be processed on certain machines.
In this research, a heuristic with capability relative to runtime and solution quality is to be developed so that maximum completion time (i.e., makespan) can be minimized. Empirical comparisons of the developed heuristic with other procedures will also be reported.
|
|---|
