Branch and bound algorithm for the flow shop with multiple processors
From MaRDI portal
(Redirected from Publication:809880)
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
Cites work
- scientific article; zbMATH DE number 3754389 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Comparative Study of Flow-Shop Algorithms
- A General Bounding Scheme for the Permutation Flow-Shop Problem
- An Adaptable Scheduling Algorithm for Flexible Flow Lines
- Flowshop and Jobshop Schedules: Complexity and Approximation
- 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
- The Complexity of Flowshop and Jobshop Scheduling
Cited in
(55)- Metaheuristic algorithms for the hybrid flowshop scheduling problem
- Steel-making process scheduling using Lagrangian relaxation
- A Pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time
- A flexible flowshop problem with total flow time minimization
- A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness
- 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
- scientific article; zbMATH DE number 1462947 (Why is no real title available?)
- 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
- Branch and bound crossed with GA to solve hybrid flowshops
- Two-stage hybrid flow shop with recirculation
- Scheduling in dial-indexed production lines
- 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
- A taxonomy of flexible flow line scheduling procedures
- Modelling multi-stage manufacturing systems for efficient scheduling
- Minimizing makespan in two-stage hybrid cross docking scheduling problem
- Sequencing a hybrid two-stage flowshop with dedicated machines
- 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
- Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion
- Scheduling manufacturing systems for delayed product differentiation in agile manufacturing
- An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation
- Worst-case analysis of heuristics for open shops with parallel machines
- Scheduling jobs on a \(k\)-stage flexible flow-shop
- Heuristics for scheduling in a flow shop with multiple processors
- A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation
- Scheduling flexible flow lines with no in-process buffers
- The flow shop with parallel machines: A tabu search approach
- Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint
- FLOWMULT: Permutation Sequences for Flow Shops with Multiple Processors
- Preemptive hybrid flowshop scheduling problem of interval orders
- Scheduling flexible flow lines with sequence-dependent setup times
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)
