Branch and bound algorithm for the flow shop with multiple processors

DOI10.1016/0377-2217(91)90148-OzbMATH Open0732.90040MaRDI QIDQ809880FDOQ809880

Authors: Shaukat A. Brah, John L. Hunsucker 

Publication date: 1991

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

Recommendations

• A multi-stage parallel-processor flowshop problem with minimum flowtime
• A flexible flowshop problem with total flow time minimization
• The two-machine flowshop total completion time problem: improved lower bounds and a branch-and-bound algorithm
• An Exact Method for Solving the Multi-Processor Flow-Shop
• A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem

zbMATH Keywords

lower boundsbranch and boundflow shopsequencingmaximum 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)

Cites Work

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

Cited In (55)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809880)