Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.

DOI10.1016/S0305-0548(97)00079-8zbMath1040.90569MaRDI QIDQ1406627

Roger Z. Ríos-Mercado, Jonathan F. Bard

Publication date: 7 September 2003

Published in: Computers \& Operations Research (Search for Journal in Brave)

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Related Items

Scheduling flexible flow lines with sequence-dependent setup times ⋮ Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times ⋮ An evolution strategy approach for the distributed permutation flowshop scheduling problem with sequence-dependent setup times ⋮ An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times ⋮ Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling ⋮ Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints ⋮ Flowshop with additional resources during setups: mathematical models and a GRASP algorithm ⋮ An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives ⋮ Hybrid flowshop scheduling with machine and resource-dependent processing times ⋮ Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times ⋮ Two models for a family of flowshop sequencing problems

Uses Software

• CPLEX
• MINTO

Cites Work

• Unnamed Item
• Unnamed Item
• An efficient algorithm for the minimum capacity cut problem
• The two-machine sequence dependent flowshop scheduling problem
• Heuristics for the flow line problem with setup costs
• MINTO, a Mixed INTeger Optimizer
• The flow shop scheduling polyhedron with setup times
• A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• A MILP model for then-job,M-stage flowshop with sequence dependent set-up times
• Multi-Terminal Network Flows
• Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
• Facets of the Asymmetric Traveling Salesman Polytope
• The Fixed-Outdegree 1-Arborescence Polytope
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• Symmetric Inequalities and Their Composition for Asymmetric Travelling Salesman Polytopes
• The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph