The flow shop scheduling polyhedron with setup times
From MaRDI portal
Publication:1417853
DOI10.1023/A:1027372722187zbMath1053.90045OpenAlexW1222945658MaRDI QIDQ1417853
Jonathan F. Bard, Roger Z. Ríos-Mercado
Publication date: 6 January 2004
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1027372722187
facet-defining inequalitiesasymmetric traveling salesman problempolyhedral combinatoricssetup timesflow shop schedulinglinear ordering problem
Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Related Items
Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date ⋮ Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups. ⋮ A survey of scheduling problems with setup times or costs ⋮ An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives ⋮ Algorithms for a realistic variant of flowshop scheduling ⋮ Heuristics for the flow line problem with setup costs
Uses Software
