Dual-Objective Mixed Integer Linear Program and Memetic Algorithm for an Industrial Group Scheduling Problem

Group scheduling problems have attracted much attention owing to their many practical applications. This work proposes a new bi-objective serial-batch group scheduling problem considering the constraints of sequence-dependent setup time, release time, and due time. It is originated from an important...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE/CAA journal of automatica sinica Ročník 8; číslo 6; s. 1199 - 1209
Hlavní autoři: Zhao, Ziyan, Liu, Shixin, Zhou, MengChu, Abusorrah, Abdullah
Médium: Journal Article
Jazyk:angličtina
Vydáno: Piscataway The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 01.06.2021
State Key Laboratory of Synthetical Automation for Process Industries and the College of Information Science and Engine,Northeastern University, Shenyang 110819, China
Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark NJ 07102 USA%State Key Laboratory of Synthetical Automation for Process Industries and the College of Information Science and Engineering,Northeastern University, Shenyang 110819, China%Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark NJ 07102 USA
Center of Research Excellence in Renewable Energy and Power Systems, King Abdulaziz University, Jeddah 21481, Saudi Arabia%Department of Electrical and Computer Engineering, Faculty of Engineering, and Center of Research Excellence in Renewable Energy and Power Systems, King Abdulaziz University, Jeddah 21481, Saudi Arabia
Témata:
Algorithms
Genetic algorithms
Greedy algorithms
Insertion-based local search
iterated greedy algorithm
Job shop scheduling
Linear programming
machine learning
memetic algorithm
Memetics
Mixed integer
nondominated sorting genetic algorithm II (NSGA-II)
production scheduling
Schedules
Scheduling
Single machine scheduling
Sorting
Sorting algorithms
Steel
Steel production
Task analysis
Time dependence
Wire rod
production scheduling
iterated greedy algorithm
machine learning
memetic algorithm
Insertion-based local search
nondominated sorting genetic algorithm Ⅱ(NSGA-II)
ISSN:2329-9266, 2329-9274
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Group scheduling problems have attracted much attention owing to their many practical applications. This work proposes a new bi-objective serial-batch group scheduling problem considering the constraints of sequence-dependent setup time, release time, and due time. It is originated from an important industrial process, i.e., wire rod and bar rolling process in steel production systems. Two objective functions, i.e., the number of late jobs and total setup time, are minimized. A mixed integer linear program is established to describe the problem. To obtain its Pareto solutions, we present a memetic algorithm that integrates a population-based nondominated sorting genetic algorithm II and two single-solution-based improvement methods, i.e., an insertion-based local search and an iterated greedy algorithm. The computational results on extensive industrial data with the scale of a one-week schedule show that the proposed algorithm has great performance in solving the concerned problem and outperforms its peers. Its high accuracy and efficiency imply its great potential to be applied to solve industrial-size group scheduling problems.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2329-9266
2329-9274
DOI:10.1109/JAS.2020.1003539