| Summary: | 碩士 === 國立臺北科技大學 === 工業工程與管理系碩士班 === 102 === This research aims to minimize the bi-criteria of Carbon Emission and total tardiness on a set of identical batch-processing machines arranged in parallel.Each machine can process multiple jobs simultaneously as long as the machine capacity is not exceeded.Each job is defined by its processing time,ready time,due date,and size.The processing time and ready time of a batch are represented by the largest processing time and release time among all jobs in the batch,respectively.For this problem,a scheduling algorithm based on the framework of the sieve algorithm was developed.Through extensive computational experiments with various problem instances, the effectiveness of the proposed algorithm was evaluated by measuring the computational efficiency and solution quality. The experiment results demonstrated that sieve algorithm had a superior performance compared to other benchmark algorithms, especially for large job instances.
|
|---|
