Iterated greedy algorithms for customer order scheduling with dedicated machines

Research output: Contribution to book/Conference proceedings/Anthology/ReportConference contributionContributedpeer-review

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

Original languageEnglish
Title of host publicationIFAC-PapersOnline
Pages1594-1599
Number of pages6
Volume55
Edition10
Publication statusPublished - 2022
Peer-reviewedYes

Conference

Title10th IFAC Conference MIM 2022 on Manufacturing Modelling, Management and Control
Conference number
Duration22 - 24 June 2022
Degree of recognitionInternational event
Location
City

External IDs

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