openHSU logo
  • English
  • Deutsch
  • Log In
  • Communities & Collections
  1. Home
  2. Helmut-Schmidt-University / University of the Federal Armed Forces Hamburg
  3. Publications
  4. 3 - Publication references (without full text)
  5. Filter-and-fan approaches for scheduling flexible job shops under workforce constraints
 
Options
Show all metadata fields

Filter-and-fan approaches for scheduling flexible job shops under workforce constraints

Publication date
2021-06-17
Document type
Forschungsartikel
Author
Müller, David
Kreß, Dominik 
Organisational unit
BWL, insb. Beschaffung und Produktion 
DOI
10.1080/00207543.2021.1937745
URI
https://openhsu.ub.hsu-hh.de/handle/10.24405/17283
ISSN
1366-588X
Series or journal
International Journal of Production Research
Periodical volume
60
Periodical issue
15
First page
4743
Last page
4765
Peer-reviewed
✅
Part of the university bibliography
✅
  • Additional Information
Keyword
Scheduling
Flexible job shop
Workforce constraints
Filter-and-fan
Constraint programming
Abstract
This paper addresses a flexible job shop scheduling problem that takes account of workforce constraints and aims to minimise the makespan. The former constraints ensure that eligible workers that operate the machines and may be heterogeneously qualified, are assigned to the machines during the processing of operations. We develop different variants of filter-and-fan (F&F) based heuristic solution approaches that combine a local search procedure with a tree search procedure. The former procedure is used to obtain local optima, while the latter procedure generates compound transitions in order to explore larger neighbourhoods. In order to be able to adapt neighbourhood structures that have formerly shown to perform well when workforce restrictions are not considered, we decompose the problem into two components for decisions on machine allocation and sequencing and decisions on worker assignment, respectively. Based on this idea, we develop multiple definitions of neighbourhoods that are successively locked and unlocked during runtime of the F&F heuristics. In a computational study, we show that our solution approaches are competitive when compared with the use of a standard constraint programming solver and that they outperform state-of-the-art heuristic approaches on average.
Cite as
Müller, D., & Kress, D. (2021). Filter-and-fan approaches for scheduling flexible job shops under workforce constraints. International Journal of Production Research, 60(15), 4743–4765. https://doi.org/10.1080/00207543.2021.1937745
Version
Published version
Access right on openHSU
Metadata only access

  • Cookie settings
  • Privacy policy
  • Send Feedback
  • Imprint