A Note on Heuristics of Flow-Shop Scheduling
From MaRDI portal
Recommendations
- Worst-case analysis of an approximation algorithm for flow-shop scheduling
- A note on worst-case analysis of approximation algorithms for a scheduling problem
- Some results of the worst-case analysis for flow shop scheduling
- A flowshop scheduling problem with two operations per job
- A New Heuristic for Three-Machine Flow Shop Scheduling
Cited in
(20)- Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling
- An efficient heuristic approach to the scheduling of jobs in a flowshop
- A new constructive heuristic for the flowshop scheduling problem
- Some results of the worst-case analysis for flow shop scheduling
- Non-bottleneck machines in three-machine flow shops
- Heuristics for scheduling in a flow shop with multiple processors
- Near-optimal heuristics for just-in-time jobs maximization in flow shop scheduling
- Flexible flow shop scheduling with uniform parallel machines
- Performance guarantees for flowshop heuristics to minimize makespan
- A new lower bounding rule for permutation flow shop scheduling
- A modification to the CGPS algorithm for three-machine flow shop scheduling
- A survey and evaluation of static flowshop scheduling heuristics
- scientific article; zbMATH DE number 3916005 (Why is no real title available?)
- scientific article; zbMATH DE number 1091396 (Why is no real title available?)
- scientific article; zbMATH DE number 1462947 (Why is no real title available?)
- A worst-case analysis of the three-machine flow shop scheduling
- Experimental comparison of heuristics for flow shop scheduling
- A fast method for heuristics in large-scale flow shop scheduling
- Some efficient heuristic methods for the flow shop sequencing problem
- A note on the proportionate flow shop with a bottleneck machine
This page was built for publication: A Note on Heuristics of Flow-Shop Scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5689787)
