کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1706408 | 1012458 | 2011 | 10 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Two meta-heuristics for parallel machine scheduling with job splitting to minimize total tardiness Two meta-heuristics for parallel machine scheduling with job splitting to minimize total tardiness](/preview/png/1706408.png)
Parallel machine scheduling is a popular research area due to its wide range of potential application areas. This paper focuses on the problem of scheduling n independent jobs to be processed on m identical parallel machines with the aim of minimizing the total tardiness of the jobs considering a job splitting property. It is assumed that a job can be split into sub-jobs and these sub-jobs can be processed independently on parallel machines. We present a mathematical model for this problem. The problem of total tardiness on identical parallel machines is NP-hard. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time by using an optimization solver is extremely difficult. We propose two meta-heuristics: Tabu search and simulated annealing. Computational results are compared on random generated problems with different sizes.
Journal: Applied Mathematical Modelling - Volume 35, Issue 8, August 2011, Pages 4117–4126