Solving Customer Order Scheduling Problems with an Iterated Greedy Algorithm

Julius Hoffmann ()
Additional contact information
Julius Hoffmann: Technische Universität Dresden

Chapter Chapter 6 in Operations Research Proceedings 2022, 2023, pp 43-49 from Springer

Abstract: Abstract In this paper, three configurations of the customer order scheduling problem are presented. In contrast to classical scheduling problems, the customer order scheduling problem considers the scheduling of jobs that belong to customer orders and each order is only completed when each job of the order has finished. The studied configurations are the minimization of the sum of order completion times and the minimization of the earliness-tardiness in a machine environment where each order places one job on each machine. Furthermore, the minimization of the sum of order completion times in a flow shop environment is investigated. This paper states properties of the three problem configurations and describes developed solution methods that performed well in a computational experiment.

Keywords: Customer order scheduling; Metaheuristics; Optimization; Iterated greedy algorithm; Manufacturing (search for similar items in EconPapers)
Date: 2023
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:lnopch:978-3-031-24907-5_6

Ordering information: This item can be ordered from
http://www.springer.com/9783031249075

DOI: 10.1007/978-3-031-24907-5_6

Access Statistics for this chapter

More chapters in Lecture Notes in Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().