A new lower bounding rule for permutation flow shop scheduling

DOI10.1080/02522667.2001.10699488zbMath0980.90028OpenAlexW2018025040MaRDI QIDQ2766112

Huey-Chin Tang

Publication date: 27 January 2002

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.2001.10699488

zbMATH Keywords

branch-and-boundflow shop scheduling

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

An experimental analysis of the CGPS algorithm for the three-machine flow shop scheduling with minimum makespan criterion

Cites Work

• On the heuristic solution of the permutation flow shop problem by path algorithms
• Minimizing makespan for flow shop scheduling by combining simulated annealing with sequencing knowledge
• An adaptive branching rule for the permutation flow-shop problem
• Two branch and bound algorithms for the permutation flow shop problem
• Sevast'yanov's algorithm for the flow-shop scheduling problem
• Some results of the worst-case analysis for flow shop scheduling
• Evaluating the performance of tabu search procedures for flow shop sequencing
• The Lessons of Flowshop Scheduling Research
• A Comparative Study of Flow-Shop Algorithms
• A General Bounding Scheme for the Permutation Flow-Shop Problem
• The Complexity of Flowshop and Jobshop Scheduling
• Optimal Elimination Methods in the m × n Flow-Shop Scheduling Problem
• Adapting Branch-and-Bound for Real-World Scheduling Problems
• Letter to the Editor—An Experimental Investigation and Comparative Evaluation of Flow-Shop Scheduling Techniques
• A Note on Heuristics of Flow-Shop Scheduling

This page was built for publication: A new lower bounding rule for permutation flow shop scheduling