A Heuristic for Variable Re-Entrant Scheduling Problems

Abstract

DOI to the publisher's website.• The final author version and the galley proof are versions of the publication after peer review.• The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rightsCopyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights.• Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal.If the publication is distributed under the terms of Article 25fa of the Dutch Copyright Act, indicated by the "Taverne" license above, please follow below link for the End User Agreement:

Sequence- and Time-Dependent Maintenance Scheduling in Twice Re-Entrant Flow Shops

“…Our heuristic approach is based on extending list schedulers to integrate maintenance activities in the schedule. Heuristic list schedulers have been developed for the industrial problem we consider [38]- [40] and are also suitable for online scheduling. Thus, we look into extending them to handle integrated production and maintenance scheduling.…”

“…Thus, we look into extending them to handle integrated production and maintenance scheduling. The typical flow of a list scheduler is to order operations according to some metric and insert them in a schedule one after the other until all operations are scheduled [40].…”