A computational study of the permutation flow shop problem based on a tight lower bound

DOI10.1016/J.COR.2003.12.001zbMath1074.90018OpenAlexW2088851523MaRDI QIDQ1777158

Talel Ladhari, Mohamed Haouari

Publication date: 12 May 2005

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

Full work available at URL: https://doi.org/10.1016/j.cor.2003.12.001

zbMATH Keywords

SchedulingPermutation flow shopBranch-and-bound algorithm

Mathematics Subject Classification ID

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

Related Items (18)

New hard benchmark for flowshop scheduling problems minimising makespan ⋮ MILP models for the optimization of real production lines ⋮ Iterative beam search algorithms for the permutation flowshop ⋮ Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems ⋮ 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 ⋮ On some lower bounds for the permutation flowshop problem ⋮ Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion ⋮ Permutation flow shop scheduling with order acceptance and weighted tardiness ⋮ A proposal for a hybrid meta-strategy for combinatorial optimization problems ⋮ Exact exponential algorithms for 3-machine flowshop scheduling problems ⋮ An improved NEH heuristic to minimize makespan in permutation flow shops ⋮ Cooperative metaheuristics for the permutation flowshop scheduling problem ⋮ Flow shop scheduling with heterogeneous workers ⋮ Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem ⋮ Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues ⋮ An empirical analysis of the optimality rate of flow shop heuristics ⋮ The nonpermutation flowshop scheduling problem: adjustment and bounding procedures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on permutation flow shop problem
• An adaptive branching rule for the permutation flow-shop problem
• On two-machine scheduling with release and due dates to minimize maximum lateness
• The one-machine sequencing problem
• Permutation vs. non-permutation flow shop schedules
• Two branch and bound algorithms for the permutation flow shop problem
• A fast tabu search algorithm for the permutation flow-shop problem
• A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
• Some results of the worst-case analysis for flow shop scheduling
• The job-shop problem and immediate selection
• Adjustment of heads and tails for the job-shop problem
• A genetic algorithm for flowshop sequencing
• Benchmarks for basic scheduling problems
• Optimal two- and three-stage production schedules with setup times included
• Minimising Maximum Lateness in a Two-Machine Flowshop
• An Automatic Method of Solving Discrete Programming Problems
• A General Bounding Scheme for the Permutation Flow-Shop Problem
• An Evaluation of Flow Shop Sequencing Heuristics
• The Complexity of Flowshop and Jobshop Scheduling
• Some simple scheduling algorithms
• A branch-and-bound-based local search method for the flow shop problem
• Mathematical aspects of the 3 × n job-shop sequencing problem
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem

This page was built for publication: A computational study of the permutation flow shop problem based on a tight lower bound