A note on permutation flow shop problem
From MaRDI portal
Recommendations
- Tight bounds for permutation flow shop scheduling
- Tight Bounds for Permutation Flow Shop Scheduling
- Approximation algorithms for the parallel flow shop problem
- A linear time approximation algorithm for permutation flow shop scheduling
- An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times
Cited in
(18)- The nonpermutation flowshop scheduling problem: adjustment and bounding procedures
- On some lower bounds for the permutation flowshop problem
- scientific article; zbMATH DE number 3916005 (Why is no real title available?)
- A linear time approximation algorithm for permutation flow shop scheduling
- Improved Bounds for Flow Shop Scheduling
- scientific article; zbMATH DE number 4089300 (Why is no real title available?)
- scientific article; zbMATH DE number 4130180 (Why is no real title available?)
- A note on scheduling jobs with missing operations in permutation flow shops
- Maximizing Throughput in Flow Shop Real-Time Scheduling
- Tight Bounds for Permutation Flow Shop Scheduling
- An improved NEH heuristic to minimize makespan in permutation flow shops
- Permutation flow shop scheduling with order acceptance and weighted tardiness
- An empirical analysis of the optimality rate of flow shop heuristics
- Tight bounds for permutation flow shop scheduling
- On the combinatorial structure of the permutation flow shop problem
- An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times
- A computational study of the permutation flow shop problem based on a tight lower bound
- Exact exponential algorithms for 3-machine flowshop scheduling problems
This page was built for publication: A note on permutation flow shop problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q596465)
