Iterated greedy algorithms for customer order scheduling with dedicated machines

Publikation: Beitrag in Buch/Konferenzbericht/Sammelband/GutachtenBeitrag in KonferenzbandBeigetragenBegutachtung

Abstract

The customer order scheduling problem has received much attention recently due to its relevance to real world applications. In this study, the minimization of the total completion time of customer orders is studied in a dedicated machine environment, i.e. each order consists of one job on each machine. Two iterated greedy algorithms are presented that make use of problem properties and apply a new local search as well as a new construction function. In a computational experiment, both algorithms outperform two state-of-the-art approaches and prove their suitability to solve the customer order scheduling problem with dedicated machines.

Details

OriginalspracheEnglisch
TitelIFAC-PapersOnline
Seiten1594-1599
Seitenumfang6
Band55
Auflage10
PublikationsstatusVeröffentlicht - 2022
Peer-Review-StatusJa

Konferenz

Titel10th IFAC Conference MIM 2022 on Manufacturing Modelling, Management and Control
Veranstaltungsnummer
Dauer22 - 24 Juni 2022
BekanntheitsgradInternationale Veranstaltung
Ort
Stadt

Externe IDs

Scopus 85144506281
ORCID /0000-0003-4711-2184/work/142252516
ORCID /0000-0003-0753-0517/work/142255247