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

Document Type

Article

Publication Date

6-1-2021

Abstract

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.

Identifier

85099089450 (Scopus)

Publication Title

IEEE Caa Journal of Automatica Sinica

External Full Text Location

https://doi.org/10.1109/JAS.2020.1003539

e-ISSN

23299274

ISSN

23299266

First Page

1199

Last Page

1209

Issue

6

Volume

8

Grant

62073069

Fund Ref

National Natural Science Foundation of China

This document is currently not available here.

Share

COinS