Solving customer order scheduling problems with an iterated greedy algorithm

DOI10.1007/978-3-031-24907-5_6MaRDI QIDQ6606519zbMATH OpenFDO

Authors Julius Hoffmann

Publication date 17 September 2024

zbMATH Keywords

optimizationmetaheuristicsmanufacturingiterated greedy algorithmcustomer order scheduling

Mathematics Subject Classification ID

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

Recommendations

• Minimizing the earliness-tardiness for the customer order scheduling problem in a dedicated machine environment
• New approximate algorithms for the customer order scheduling problem with total completion time objective
• The complexity of customer order scheduling problems on parallel machines
• Tailoring customer order scheduling search algorithms
• Coordinated scheduling of customer orders for quick response

Cites work

• New approximate algorithms for the customer order scheduling problem with total completion time objective
• Order scheduling in an environment with dedicated resources in parallel
• 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

Cited in

(1)

• Minimizing the earliness-tardiness for the customer order scheduling problem in a dedicated machine environment

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606519)