On ‘redundant’ constraints in Stafford's MILP model for the flowshop problem

DOI10.1057/palgrave.jors.2601615zbMath1095.90557OpenAlexW2047018747MaRDI QIDQ4661167

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

Publication date: 4 April 2005

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.2601615

zbMATH Keywords

optimizationinteger programmingschedulingsequencingcombinatorial analysis

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint ⋮ Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling ⋮ Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness

This page was built for publication: On ‘redundant’ constraints in Stafford's MILP model for the flowshop problem