A New Heuristic for Three-Machine Flow Shop Scheduling

From MaRDI portal
Revision as of 22:22, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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 graphFlow-shop scheduling for three serial stations with the last two duplicateAn approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shopsComplexity and approximation of open shop scheduling to minimize the makespan: a review of models and approachesA worst-case analysis of the three-machine flow shop schedulingAn experimental analysis of the CGPS algorithm for the three-machine flow shop scheduling with minimum makespan criterionTwo simple and effective heuristics for minimizing the makespan in non-permutation flow shopsSolving then-job 3-stage flexible flowshop scheduling problem using an agent-based approachA bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch sizeA fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshopsTwo-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experimentsA PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the MakespanAn FPTAS for the parallel two-stage flowshop problemFlow shop scheduling with heterogeneous workersA modification to the CGPS algorithm for three-machine flow shop schedulingThe three-stage assembly flowshop scheduling problemCOMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHMHeuristics for the two-stage job shop scheduling problem with a bottleneck machineA hybrid three-stage flowshop problem: Efficient heuristics to minimize makespanNon-bottleneck machines in three-machine flow shopsPerformance guarantees for flowshop heuristics to minimize makespanThe Optimal Order Policy for a Capacitated Multiple Product Inventory System Under SymmetryA 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