Permutation flow shop scheduling with multiple lines and demand plans using reinforcement learning
Janis Brammer,
Bernhard Lutz and
Dirk Neumann
European Journal of Operational Research, 2022, vol. 299, issue 1, 75-86
Abstract:
Existing studies on the permutation flow shop problem (PFSP) commonly assume that jobs are produced on a single line. However, manufacturers may speed up their production by employing multiple lines, where each line produces sub-parts of the final product; which must be assembled by a synchronization machine. This study presents a novel reinforcement learning (RL) approach for the PFSP with multiple lines and demand plans. Our approach differs from existing RL-based scheduling methods as we train the policy to directly generate the sequence in an iterative way, where actions denote the job type to be sequenced next. During cutoff time, we follow a multistart approach that generates sequences with the trained policy, which are subsequently optimized by local search. Our numerical evaluation based on 1050 problem instances with up to three production lines shows that our approach outperforms existing methods on the multi-line problems for short cutoff times, while there is a tie with existing methods for medium and long cutoff times. A further analysis suggests that our approach can also be applied to problems with imbalanced demand plans.
Keywords: Scheduling; Permutation flow shop problem; Reinforcement learning; Mixed-integer programming; Constraint programming (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221721006743
Full text for ScienceDirect subscribers only
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:eee:ejores:v:299:y:2022:i:1:p:75-86
DOI: 10.1016/j.ejor.2021.08.007
Access Statistics for this article
European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati
More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().