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

DOI10.1016/j.mcm.2012.06.029zbMath1305.90171OpenAlexW2018880051MaRDI QIDQ2256404

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

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

zbMATH Keywords

schedulingearlinessmixed integer programmingtardinesssequence-dependent setups

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

The third comprehensive survey on scheduling problems with setup times/costs ⋮ An application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel Electronics

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