A new integer programming formulation for the permutation flowshop problem

DOI10.1016/0377-2217(89)90276-2zbMath0673.90054OpenAlexW2015411036WikidataQ57401603 ScholiaQ57401603MaRDI QIDQ1121163

J. Yadegar, Alan M. Frieze

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0377-2217(89)90276-2

zbMATH Keywords

graphsheuristiclinear programming relaxationcomputational experienceassignmentpolynomial timepermutation flowshopexponential number of constraintsminimise the makespan

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Integer programming (90C10) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items

A tabu-search heuristic for the flexible-resource flow shop scheduling problem ⋮ Minimizing total tardiness in permutation flowshops ⋮ Multiple and bicriteria scheduling: A literature survey ⋮ A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An adaptive branching rule for the permutation flow-shop problem
• The ellipsoid method and its consequences in combinatorial optimization
• Optimal two- and three-stage production schedules with setup times included
• A Comparative Study of Flow-Shop Algorithms
• On general routing problems
• A General Bounding Scheme for the Permutation Flow-Shop Problem
• The Complexity of Flowshop and Jobshop Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A General Algorithm for Solution of the n-Job, M-Machine Sequencing Problem of the Flow Shop
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• Elimination methods in them ×n sequencing problem