Scheduling unrelated parallel machines with attribute-dependent setup times: a case study

DOI10.1007/978-3-031-24907-5_69zbMATH Open1547.90085MaRDI QIDQ6606606

Neele Leithäuser, Sebastian Velten, Sven Jäger, Christian Weiß

Publication date: 17 September 2024

zbMATH Keywords

heuristicsschedulingconstraint programmingunrelated machinessetup timesiterated greedy

Mathematics Subject Classification ID

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

Cites Work

• The third comprehensive survey on scheduling problems with setup times/costs
• An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives

This page was built for publication: Scheduling unrelated parallel machines with attribute-dependent setup times: a case study

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