Proportionate flow shop with controllable processing times
From MaRDI portal
Recommendations
- Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
- Minimizing total weighted completion time in a proportionate flow shop
- The three-machine proportionate flow shop problem with unequal machine speeds
- A two-machine flow shop scheduling problem with controllable job processing times
- Proportionate flowshops with general position-dependent processing times
Cites work
- [article; zbMATH DE number 52239 (Why is no real title available?)]
- A Note on Stochastic Shop Models in Which Jobs have the Same Processing Requirements on Each Machine
- A survey of results for sequencing problems with controllable processing times
- A two-machine flow shop scheduling problem with controllable job processing times
- An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times
- Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
- Complexity of single machine hierarchical scheduling: A survey
- Focused Scheduling in Proportionate Flowshops
- Minimizing total weighted completion time in a proportionate flow shop
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
Cited in
(14)- Multicriteria scheduling
- Approximation schemes for parallel machine scheduling problems with controllable processing times
- Focused Scheduling in Proportionate Flowshops
- Two-stage proportionate flexible flow shop to minimize the makespan
- Proportionate flow shop games
- On equivalence between the proportionate flow shop and single-machine scheduling problems
- A search method for optimal control of a flow shop system of traditional machines
- Minimizing maximum completion time in a proportionate flow shop with one machine of different speed
- The three-machine proportionate flow shop problem with unequal machine speeds
- A survey of scheduling with controllable processing times
- Proportionate flow shop: new complexity results and models with due date assignment
- Approximation schemes for job shop scheduling problems with controllable processing times
- Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness
- Two-machine flow shop scheduling with convex resource consumption functions
This page was built for publication: Proportionate flow shop with controllable processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1964482)