A General Bounding Scheme for the Permutation Flow-Shop Problem

DOI10.1287/OPRE.26.1.53zbMath0371.90059OpenAlexW1999339786MaRDI QIDQ4147823

Alexander H. G. Rinnooy Kan, B. J. Lageweg, Jan Karel Lenstra

Publication date: 1978

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.26.1.53

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35)

Related Items (50)

Competitive production scheduling: A two-firm, noncooperative finite dynamic game ⋮ A new node selection strategy in the branch-and-bound procedure ⋮ 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 ⋮ Lot streaming in the two-machine flow shop with setup times ⋮ 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 ⋮ An exact parallel method for a bi-objective permutation flowshop problem ⋮ A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems ⋮ Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times ⋮ SEQUENCING CONTROL OF PHYSICO‐CHEMICAL PROCESSES ⋮ Two-stage flowshop scheduling with a common second-stage machine ⋮ A new integer programming formulation for the permutation flowshop problem ⋮ Ranking multiple criteria alternatives with half-space, convex, and non- convex dominating cones: Quasi-concave and quasi-convex multiple attribute utility functions ⋮ 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 ⋮ An adaptive branching rule for the permutation flow-shop problem ⋮ Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion ⋮ Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry ⋮ Permutation flow shop scheduling with order acceptance and weighted tardiness ⋮ A branch-and-bound approach to the no-idle flowshop scheduling problem ⋮ General flow-shop scheduling with resource constraints ⋮ Application of an optimization problem in max-plus algebra to scheduling problems ⋮ Minimizing the weighted number of tardy jobs on a two-machine flow shop. ⋮ Flow shop scheduling problem with conflict graphs ⋮ A unified framework for population-based metaheuristics ⋮ An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. ⋮ Non-permutation flow shop scheduling with order acceptance and weighted tardiness ⋮ Exact exponential algorithms for 3-machine flowshop scheduling problems ⋮ On the heuristic solution of the permutation flow shop problem by path algorithms ⋮ 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 ⋮ Scheduling preemptive open shops to minimize total tardiness ⋮ A computational study of the permutation flow shop problem based on a tight lower bound ⋮ Permutation flow shop scheduling with earliness and tardiness penalties ⋮ Generating improved dominance conditions for the flowshop problem ⋮ Elimination conditions and lower bounds for the permutation flow-shop sequencing problem ⋮ P2P B&B and GA for the Flow-Shop Scheduling Problem ⋮ A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops ⋮ Two branch and bound algorithms for the permutation flow shop problem ⋮ The job shop scheduling problem: Conventional and new solution techniques ⋮ Généralisation Max-Plus des bornes de Lageweg, Lenstra et Rinnooy Kan ⋮ A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem ⋮ Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints ⋮ Flowshop scheduling research after five decades ⋮ Algorithms for two-machine flow-shop sequencing with precedence constraints ⋮ Branch and bound algorithm for the flow shop with multiple processors

This page was built for publication: A General Bounding Scheme for the Permutation Flow-Shop Problem