Solving customer order scheduling problems with an iterated greedy algorithm

DOI10.1007/978-3-031-24907-5_6zbMATH Open1547.90083MaRDI QIDQ6606519

Julius Hoffmann

Publication date: 17 September 2024

zbMATH Keywords

optimizationmanufacturingmetaheuristicsiterated greedy algorithmcustomer order scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Order scheduling in an environment with dedicated resources in parallel
• New approximate algorithms for the customer order scheduling problem with total completion time objective
• Order scheduling with tardiness objective: improved approximate solutions
• Preemptive multiprocessor order scheduling to minimize total weighted flowtime
• Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm

This page was built for publication: Solving customer order scheduling problems with an iterated greedy algorithm