Pages that link to "Item:Q1310020"
From MaRDI portal
The following pages link to An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times (Q1310020):
Displaying 15 items.
- A note on permutation flow shop problem (Q596465) (← links)
- A linear time approximation algorithm for permutation flow shop scheduling (Q764320) (← links)
- A search method for optimal control of a flow shop system of traditional machines (Q976446) (← links)
- A two-machine flow shop scheduling problem with controllable job processing times (Q1104846) (← links)
- Worst-case analysis of an approximation algorithm for flow-shop scheduling (Q1121778) (← links)
- Flow shop scheduling with flexible processing times (Q1621840) (← links)
- Approximation schemes for parallel machine scheduling problems with controllable processing times (Q1885962) (← links)
- Proportionate flow shop with controllable processing times (Q1964482) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness (Q2147170) (← links)
- Two-stage production scheduling with an outsourcing option (Q2275802) (← links)
- A survey of scheduling with controllable processing times (Q2381529) (← links)
- Two-machine open shop problem with controllable processing times (Q2467128) (← links)
- Approximation schemes for job shop scheduling problems with controllable processing times (Q2485329) (← links)
- An <i>O</i>(<i>n</i> log <i>n</i>) Algorithm for the Two-Machine Flow Shop Problem with Controllable Machine Speeds (Q4367053) (← links)
