An adaptive branching rule for the permutation flow-shop problem
From MaRDI portal
Publication:1141078
DOI10.1016/0377-2217(80)90069-7zbMath0436.90063OpenAlexW1999602996MaRDI QIDQ1141078
Publication date: 1980
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(80)90069-7
branch-and-bound algorithmupper boundscomputational resultssearch treeadaptive branching ruleminimization of maximum completion timepermutation flow-shop problem
Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)
Related Items (29)
Adjustment of heads and tails for the job-shop problem ⋮ 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. ⋮ Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers ⋮ An experimental analysis of the CGPS algorithm for the three-machine flow shop scheduling with minimum makespan criterion ⋮ 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 new integer programming formulation for the permutation flowshop problem ⋮ A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop ⋮ Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem ⋮ A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem ⋮ Minimizing total tardiness in permutation flowshops ⋮ Flowshop sequencing problems with limited buffer storage ⋮ Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion ⋮ Heuristics and their design: A survey ⋮ Minimizing the weighted number of tardy jobs on a two-machine flow shop. ⋮ Exact exponential algorithms for 3-machine 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 ⋮ Decomposition approaches in permutation scheduling problems with application to the M-machine flow shop scheduling problems ⋮ A computational study of the permutation flow shop problem based on a tight lower bound ⋮ Elimination conditions and lower bounds for the permutation flow-shop sequencing problem ⋮ Flowshop-scheduling problems with makespan criterion: a review ⋮ Two branch and bound algorithms for the permutation flow shop problem ⋮ The job shop scheduling problem: Conventional and new solution techniques ⋮ A review of TSP based approaches for flowshop scheduling ⋮ Heuristics for the flow line problem with setup costs ⋮ Note on an improved branch-and-bound algorithm to solve \(n/m/P/F_{\text{max}}\) problems ⋮ An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times ⋮ Algorithms for two-machine flow-shop sequencing with precedence constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling two job classes on a single machine
- 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
- Job-Shop Scheduling by Implicit Enumeration
- The Complexity of Flowshop and Jobshop Scheduling
- Elimination methods in them ×n sequencing problem
This page was built for publication: An adaptive branching rule for the permutation flow-shop problem
