New MILP models for the permutation flowshop problem

DOI10.1057/palgrave.jors.2602455zbMath1155.90395OpenAlexW2013673014MaRDI QIDQ3612203

Edward F. jun. Stafford, F. T. Tseng

Publication date: 3 March 2009

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2602455

zbMATH Keywords

integer programmingschedulingsequencingcomputational analysis

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items (9)

MILP models for the optimization of real production lines ⋮ Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint ⋮ Energy-efficient bi-objective single-machine scheduling with power-down mechanism ⋮ Solving permutation flow shop scheduling problem with sequence-independent setup time ⋮ Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry ⋮ A study on open shop scheduling to minimise total tardiness ⋮ Solving integrated operating room planning and scheduling: logic-based Benders decomposition versus branch-price-and-cut ⋮ The distributed permutation flowshop scheduling problem ⋮ Polynomial time approximation algorithms for proportionate open‐shop scheduling

This page was built for publication: New MILP models for the permutation flowshop problem