Modeling and solving for bi-objective cutting parallel machine scheduling problem

Ronghua Meng (), Yunqing Rao () and Qiang Luo
Additional contact information
Ronghua Meng: Huazhong University of Science and Technology
Yunqing Rao: Huazhong University of Science and Technology
Qiang Luo: Huazhong University of Science and Technology

Annals of Operations Research, 2020, vol. 285, issue 1, No 10, 223-245

Abstract: Abstract This paper addresses a bi-objective cutting parallel machine scheduling problem aiming to minimize the total makespan and total tardiness. This problem is inspired from a structural metal-cutting plant that combines identical and unrelated parallel machine scheduling problems. To formulate this complicated problem, a new mixed-integer programming (MIP) model is presented in consideration of total makespan and total tardiness. The machine-job-dependent processing times are considered along with the setup times, pickup times, different delivery times, and machine eligibility constraints. Owing to the complex characteristics of the problem, an appropriate non-dominated sorting Genetic Algorithm III (NSGAIII) with an embedded variable neighborhood structure strategy (VNSGAIII) is developed. A number of randomly generated datasets are used to test the performance of VNSGAIII in comparison with NSGAII, and NSGAIII on solving the engineering problem addressed herein. The experimental results demonstrate that the suggested VNSGAIII statistically outperforms the compared algorithms, especially in the distribution of Pareto solutions. The ε-constrained method is implemented in the direct MIP model by CPLEX for comparison with the proposed evolutionary algorithms. The proposed algorithm performs efficiently when obtaining the Pareto solutions.

Keywords: Parallel machine scheduling problem; NSGA III; Bi-objective problem; Makespan; Tardiness (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-019-03208-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:285:y:2020:i:1:d:10.1007_s10479-019-03208-z

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-019-03208-z

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().