A heuristic for variable re-entrant scheduling problems

Roel van der Tempel, J.H.H. van Pinxten, Marc Geilen, Umar Waqas

Research output: Book/ReportReportProfessional

177 Downloads (Pure)


Flexible Manufacturing Systems (FMSs) need a scheduler to provide timing instructions for the operations of different products. Previous work has presented heuristics for fixed-order 2-re-entrant scheduling problems [1], [2]; where products visit a re-entrant machine exactly two times for production. We propose an extension to this scheduling model, and an extension to the scheduling heuristic, that allows jobs to move along different flows on re-entrant machines; i.e. jobs can (re)visit the re-entrant machine once or twice. An FMS that requires such variable re-entrance with fixed-order output is a Large Scale Printer (LSP). The scheduling problem in an LSP is modeled as a variable re-entrance flowshop with relative due dates and sequence-dependent setup times. We identify the impact of the fixed order requirement on the variable re-entrance scheduling problem. We show that out-of-order input of products can be beneficial to the scheduling quality in variable re-entrance scheduling. The fixed re-entrant heuristic of [1] is extended with a method to order operations on the re-entrant machine to minimize the completion time of variable re-entrant job sets. The resulting heuristic produces good quality schedules for variable re-entrant job sets without losing schedule quality for fixed reentrant job sets
Original languageEnglish
Place of PublicationEindhoven
PublisherTechnische Universiteit Eindhoven
Number of pages8
Publication statusPublished - Jun 2018

Publication series

NameES reports
ISSN (Print)1574-9517


Dive into the research topics of 'A heuristic for variable re-entrant scheduling problems'. Together they form a unique fingerprint.

Cite this