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

DOI10.1016/J.MCM.2012.06.029MaRDI QIDQ2256404zbMATHOpenAlexFDO

Authors 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

schedulingmixed integer programmingtardinesssequence-dependent setupsearliness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

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

Cited in

(4)

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

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)