کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1032661 | 943255 | 2013 | 6 صفحه PDF | دانلود رایگان |
This paper considers a variation of the classical single machine scheduling problem with tool changes. In the variation, two sets of jobs, namely special jobs and normal jobs, are considered. By special jobs, we mean that each special job must be processed within the first prefixed time units of a tool life. To solve the scheduling problem with small size and moderate size, we propose two mathematical programming models. To solve the scheduling problem with large size, we propose three sets of algorithms and focus on the performance of six algorithms based on the studies of a new bin packing problem. Worst-case analysis is conducted. Numerical experiment shows that each of the six algorithms can solve instances with up to 5000 jobs in about 0.5 s with an average relative error less than 4%.
► Tool changes and special jobs are considered simultaneously in machine scheduling.
► Two mathematical programming models are formulated.
► The scheduling problem is transformed into a new bin packing problem.
► Six algorithms for the scheduling problem are obtained via transformation.
► Theoretical analysis and numerical results are presented for the scheduling problem.
Journal: Omega - Volume 41, Issue 2, April 2013, Pages 299–304