An efficient network-based formulation for sequence dependent setup scheduling on parallel identical machines

DOI10.1016/J.MCM.2012.06.029zbMATH Open1305.90171OpenAlexW2018880051MaRDI QIDQ2256404FDOQ2256404

Kurt M. Bretthauer, Bradley E. Anderson, Munirpallam A. Venkataramanan, James D. Blocher

Publication date: 19 February 2015

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2012.06.029

Recommendations

• Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization
• Early/tardy scheduling with sequence dependent setups on uniform parallel machines
• Heuristic scheduling of parallel machines with sequence-dependent set-up times
• A column generation for a parallel machine scheduling with sequence-dependent setup times
• A scheduling problem with unrelated parallel machines and sequence dependent setups

zbMATH Keywords

schedulingmixed integer programmingtardinesssequence-dependent setupsearliness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (4)

• An application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel Electronics
• Integrated network design and scheduling problems with parallel identical machines: Complexity results and dispatching rules
• The third comprehensive survey on scheduling problems with setup times/costs
• Minimization of maximum lateness on parallel machines with a single server and job release dates

This page was built for publication: An efficient network-based formulation for sequence dependent setup scheduling on parallel identical machines

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