Pages that link to "Item:Q1290641"
From MaRDI portal
The following pages link to Makespan minimization in open shops: A polynomial time approximation scheme (Q1290641):
Displaying 8 items.
- The three-machine proportionate open shop and mixed shop minimum makespan problems (Q319016) (← links)
- A study on several combination problems of classic shop scheduling and shortest path (Q344790) (← links)
- Approximating a two-machine flow shop scheduling under discrete scenario uncertainty (Q439320) (← links)
- A fluid approach to large volume job shop scheduling (Q600845) (← links)
- Inapproximability results for no-wait job shop scheduling. (Q703234) (← links)
- Polynomial time approximation algorithms for proportionate open‐shop scheduling (Q5246814) (← links)
- Approximation Algorithms for Generalized Path Scheduling (Q6065400) (← links)
- A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints (Q6204660) (← links)
