A New Heuristic for Three-Machine Flow Shop Scheduling
From MaRDI portal
Publication:4346341
DOI10.1287/OPRE.44.6.891zbMATH Open0879.90112OpenAlexW2035754921MaRDI QIDQ4346341FDOQ4346341
Authors: Bo Chen, Chris N. Potts, C. A. Glass, V. A. Strusevich 
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
Recommendations
Cited In (36)
- A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time
- A worst-case analysis of the three-machine flow shop scheduling
- An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops
- A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan
- Performance guarantees for flowshop heuristics to minimize makespan
- A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size
- Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments
- An experimental analysis of the CGPS algorithm for the three-machine flow shop scheduling with minimum makespan criterion
- Exact exponential algorithms for 3-machine flowshop scheduling problems
- Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph
- Title not available (Why is that?)
- Three-machine flow shop scheduling with overlapping waiting time constraints
- A modification to the CGPS algorithm for three-machine flow shop scheduling
- Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
- Optimal scheduling of the 3-machine assembly-type flow shop
- Solving then-job 3-stage flexible flowshop scheduling problem using an agent-based approach
- New heuristics for flow shop problem to minimize makespan
- A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan
- Flow-shop scheduling for three serial stations with the last two duplicate
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
- Non-bottleneck machines in three-machine flow shops
- The optimal order policy for a capacitated multiple product inventory system under symmetry
- A combination of flow shop scheduling and the shortest path problem
- COMPARISON OF SCHEDULING EFFICIENCY IN TWO/THREE-MACHINE NO-WAIT FLOW SHOP PROBLEM USING SIMULATED ANNEALING AND GENETIC ALGORITHM
- Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops
- Algorithms for three-machine flowshop scheduling problem to minimize makespan with uncertain processing times
- The three-stage assembly flowshop scheduling problem
- Scheduling three-operation jobs in a two-machine flow shop to minimize makespan
- Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling
- Three-machine shop scheduling with partially ordered processing routes
- An FPTAS for the parallel two-stage flowshop problem
- Flow shop scheduling with heterogeneous workers
- A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops
- Heuristics for the two-stage job shop scheduling problem with a bottleneck machine
- Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits
- A new three-machine shop scheduling: complexity and approximation algorithm
This page was built for publication: A New Heuristic for Three-Machine Flow Shop Scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4346341)
