Metaheuristics for the online printing shop scheduling problem

Author(s)

Lunardi, Willian T. ^[1] ; Birgin, Ernesto G. ^[2] ; Ronconi, Debora P. ^[3] ; Voos, Holger ^[1]

Affiliation

^[1] Univ Luxembourg, 29 John F Kennedy, L-1855 Luxembourg - Luxembourg

^[2] Univ Sao Paulo, Inst Math & Stat, Dept Comp Sci, Rua Matao 1010, Cidade Univ, BR-05508090 Sao Paulo, SP - Brazil

^[3] Univ Sao Paulo, Polytech Sch, Dept Prod Engn, Av Prof Luciano Gualberto 1380, Cidade Univ, BR-05508090 Sao Paulo, SP - Brazil

• Document type: Journal article
• Source: European Journal of Operational Research; v. 293, n. 2, p. 419-441, SEP 1 2021.
• Web of Science Citations: 2

Abstract

In this work, the online printing shop scheduling problem is considered. This challenging real-world scheduling problem, that emerged in the present-day printing industry, corresponds to a flexible job shop scheduling problem with sequencing flexibility; and it presents several complicating requirements such as resumable operations, periods of unavailability of the machines, sequence-dependent setup times, partial overlapping between operations with precedence constraints, and fixed operations, among others. A local search strategy and metaheuristics are proposed and evaluated. Based on a common representation scheme, trajectory and populational metaheuristics are considered. Extensive numerical experiments on large-sized instances show that the proposed methods are suitable for solving practical instances of the problem; and that they outperform a half-heuristic-half-exact off-the-shelf solver by a large extent. In addition, numerical experiments on classical instances of the flexible job shop scheduling problem show that the proposed methods are also competitive when applied to this particular case. (C) 2020 Elsevier B.V. All rights reserved. (AU)

• FAPESP's process: 13/07375-0 - CeMEAI - Center for Mathematical Sciences Applied to Industry
• Grantee: Francisco Louzada Neto
• Support Opportunities: Research Grants - Research, Innovation and Dissemination Centers - RIDC
• FAPESP's process: 16/01860-1 - Cutting, packing, lot-sizing, scheduling, routing and location problems and their integration in industrial and logistics settings
• Grantee: Reinaldo Morabito Neto
• Support Opportunities: Research Projects - Thematic Grants
• FAPESP's process: 18/24293-0 - Computational methods in optimization
• Grantee: Sandra Augusta Santos
• Support Opportunities: Research Projects - Thematic Grants