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

DOI10.1007/978-3-031-24907-5_69MaRDI QIDQ6606606zbMATH OpenFDO

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

Publication date 17 September 2024

Full work available at URL https://doi.org/10.1007/978-3-031-24907-5_69

zbMATH Keywords

constraint programmingheuristicsiterated greedyschedulingsetup timesunrelated machines

Mathematics Subject Classification ID

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

Recommendations

• A scheduling problem with unrelated parallel machines and sequence dependent setups
• Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
• Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times
• Heuristic scheduling of parallel machines with sequence-dependent set-up times
• Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization

Cites work

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

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)