Branch and bound algorithm for the flow shop with multiple processors

DOI10.1016/0377-2217(91)90148-OzbMath0732.90040MaRDI QIDQ809880

John L. Hunsucker, Shaukat A. Brah

Publication date: 1991

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

zbMATH Keywords

branch and boundsequencingflow shoplower boundsmaximum completion timemultiple processors

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (54)

Scheduling flexible flow lines with sequence-dependent setup times ⋮ Scheduling a two-stage hybrid flowshop with separable setup and removal times ⋮ A new complexity proof for the two-stage hybrid flow shop scheduling problem with dedicated machines ⋮ A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation ⋮ Scheduling manufacturing systems for delayed product differentiation in agile manufacturing ⋮ An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times ⋮ A two-stage hybrid flow shop with dedicated machines at the first stage ⋮ Minimizing total completion time in a two-stage hybrid flow shop with dedicated machines at the first stage ⋮ Optimal scheduling of a two-stage hybrid flow shop ⋮ A taxonomy of flexible flow line scheduling procedures ⋮ Global lower bounds for flow shops with multiple processors ⋮ Minimizing total completion time in two-stage hybrid flow shop with dedicated machines ⋮ Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion ⋮ Unnamed Item ⋮ Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel-machine-scheduling problem ⋮ A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property ⋮ Modeling realistic hybrid flexible flowshop scheduling problems ⋮ An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation ⋮ Two-stage hybrid flow shop with recirculation ⋮ A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations ⋮ A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria ⋮ A two-stage hybrid flowshop with uniform machines and setup times ⋮ A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness ⋮ Scheduling flexible flow lines with no in-process buffers ⋮ Continuous flow models for batch manufacturing: a basis for a hierarchical approach ⋮ A review of exact solution methods for the non-preemptive multiprocessor flowshop problem ⋮ A flexible flowshop problem with total flow time minimization ⋮ The hybrid flow shop scheduling problem ⋮ Scheduling two-stage hybrid flow shop with availability constraints ⋮ Scheduling jobs on a \(k\)-stage flexible flow-shop ⋮ Metaheuristic algorithms for the hybrid flowshop scheduling problem ⋮ Comparison of Scheduling Rules in a Flow Shop with Multiple Processors: A Simulation ⋮ Preemptive hybrid flowshop scheduling problem of interval orders ⋮ A Pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time ⋮ A class of multi-objective expected value decision-making model with birandom coefficients and its application to flow shop scheduling problem ⋮ Minimizing makespan in two-stage hybrid cross docking scheduling problem ⋮ Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint ⋮ Steel-making process scheduling using Lagrangian relaxation ⋮ Heuristics for scheduling in a flow shop with multiple processors ⋮ Sequencing a hybrid two-stage flowshop with dedicated machines ⋮ Conceptual framework for lot-sizing and scheduling of flexible flow lines ⋮ Scheduling of a single crane in batch annealing process ⋮ Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard ⋮ FLOWMULT: Permutation Sequences for Flow Shops with Multiple Processors ⋮ Scheduling in dial-indexed production lines ⋮ Branch and bound crossed with GA to solve hybrid flowshops ⋮ Modelling multi-stage manufacturing systems for efficient scheduling ⋮ A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility ⋮ A scheduling problem in the baking industry ⋮ Worst-case analysis of heuristics for open shops with parallel machines ⋮ Heuristics for hybrid flow shops with controllable processing times and assignable due dates ⋮ Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment ⋮ The flow shop with parallel machines: A tabu search approach ⋮ Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• An Adaptable Scheduling Algorithm for Flexible Flow Lines
• Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops
• Scheduling with earliest start and due date constraints on multiple machines
• A Comparative Study of Flow-Shop Algorithms
• A General Bounding Scheme for the Permutation Flow-Shop Problem
• Flowshop and Jobshop Schedules: Complexity and Approximation
• The Complexity of Flowshop and Jobshop Scheduling

This page was built for publication: Branch and bound algorithm for the flow shop with multiple processors