A New Heuristic for Three-Machine Flow Shop Scheduling
From MaRDI portal
Publication:4346341
DOI10.1287/opre.44.6.891zbMath0879.90112OpenAlexW2035754921MaRDI QIDQ4346341
Bo Chen, Chris N. Potts, Vitaly A. Strusevich, Celia A. Dr. Glass
Publication date: 3 August 1997
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.44.6.891
Related Items (23)
Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph ⋮ Flow-shop scheduling for three serial stations with the last two duplicate ⋮ An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ A worst-case analysis of the three-machine flow shop scheduling ⋮ An experimental analysis of the CGPS algorithm for the three-machine flow shop scheduling with minimum makespan criterion ⋮ Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops ⋮ Solving then-job 3-stage flexible flowshop scheduling problem using an agent-based approach ⋮ A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size ⋮ A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops ⋮ Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments ⋮ A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan ⋮ An FPTAS for the parallel two-stage flowshop problem ⋮ Flow shop scheduling with heterogeneous workers ⋮ A modification to the CGPS algorithm for three-machine flow shop scheduling ⋮ The three-stage assembly flowshop scheduling problem ⋮ COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM ⋮ Heuristics for the two-stage job shop scheduling problem with a bottleneck machine ⋮ A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan ⋮ Non-bottleneck machines in three-machine flow shops ⋮ Performance guarantees for flowshop heuristics to minimize makespan ⋮ The Optimal Order Policy for a Capacitated Multiple Product Inventory System Under Symmetry ⋮ A combination of flow shop scheduling and the shortest path problem
This page was built for publication: A New Heuristic for Three-Machine Flow Shop Scheduling