Two branch and bound algorithms for the permutation flow shop problem

DOI10.1016/0377-2217(95)00352-5zbMath0913.90162OpenAlexW2012238981MaRDI QIDQ1266538

Ismaïl Rebaï, Jacques Carlier

Publication date: 29 November 1998

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

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00352-5

zbMATH Keywords

branch-and-boundexact methodspermutation flow shop problemheads and tails

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (19)

Flow-shop scheduling for three serial stations with the last two duplicate ⋮ Iterative beam search algorithms for the permutation flowshop ⋮ Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times. ⋮ Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines ⋮ Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems ⋮ A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal ⋮ A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem ⋮ On some lower bounds for the permutation flowshop problem ⋮ Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion ⋮ Exact resolution of the two-stage hybrid flow shop with dedicated machines ⋮ Exact exponential algorithms for 3-machine flowshop scheduling problems ⋮ Exact solution procedures for the balanced unidirectional cyclic layout problem ⋮ Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems ⋮ A new lower bounding rule for permutation flow shop scheduling ⋮ A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times ⋮ A computational study of the permutation flow shop problem based on a tight lower bound ⋮ A bicriteria two-machine permutation flowshop problem ⋮ The nonpermutation flowshop scheduling problem: adjustment and bounding procedures ⋮ Heuristics for the flow line problem with setup costs

Cites Work

• Unnamed Item
• Unnamed Item
• A practical use of Jackson's preemptive schedule for solving the job shop problem
• A new heuristic method for the flow shop sequencing problem
• An adaptive branching rule for the permutation flow-shop problem
• The one-machine sequencing problem
• A branch and bound algorithm for the job-shop scheduling problem
• Adjustment of heads and tails for the job-shop problem
• Flow shop scheduling with lot streaming
• The two-machine flow shop problem with arbitrary precedence relations
• Benchmarks for basic scheduling problems
• Une heuristique pour le problème d’ordonnancement de type $n/m//F/C_{\text{max}}$ avec la présence de machines goulots
• A concise survey of efficiently solvable special cases of the permutation flow-shop problem
• An Algorithm for Solving the Job-Shop Problem
• Scheduling unit-time tasks in renewable resource constrained flowshops
• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
• A General Bounding Scheme for the Permutation Flow-Shop Problem
• Ordonnancements à contraintes disjonctives
• Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem

This page was built for publication: Two branch and bound algorithms for the permutation flow shop problem