Scheduling a two-stage hybrid flow shop with parallel machines at the first stage
From MaRDI portal
Publication:1357780
DOI10.1023/A:1018976827443zbMath0880.90071OpenAlexW152978804MaRDI QIDQ1357780
A. M. A. Hariri, Jatinder N. D. Gupta, Chris N. Potts
Publication date: 16 June 1997
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018976827443
heuristicsbranch and boundmakespanlower boundsmaximum completion timeidentical parallel machinesnon-preemptive two-stage hybrid flow shop
Related Items
A new complexity proof for the two-stage hybrid flow shop scheduling problem with dedicated machines ⋮ Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective ⋮ An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops ⋮ 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 heuristic method for two-stage hybrid flow shop with dedicated machines ⋮ Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP) ⋮ A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops ⋮ Minimizing total completion time in two-stage hybrid flow shop with dedicated machines ⋮ Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop. ⋮ Approximation algorithms for the parallel flow shop problem ⋮ Unnamed Item ⋮ Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach ⋮ Case study on statistically estimating minimum makespan for flow line scheduling problems. ⋮ A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan ⋮ A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines ⋮ An FPTAS for the parallel two-stage flowshop problem ⋮ Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage ⋮ A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness ⋮ The hybrid flow shop scheduling problem ⋮ A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time ⋮ Scheduling multistage hybrid flowshops with multiprocessor tasks by an effective heuristic ⋮ Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint ⋮ Optimal solutions for a dock assignment problem with trailer transportation ⋮ A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops ⋮ A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
