Pages that link to "Item:Q319016"
From MaRDI portal
The following pages link to The three-machine proportionate open shop and mixed shop minimum makespan problems (Q319016):
Displaying 13 items.
- The two-machine no-wait general and proportionate open shop makespan problem (Q296784) (← links)
- The three-machine proportionate flow shop problem with unequal machine speeds (Q1811632) (← links)
- Exponential tightness for integral-type functionals of centered independent differently distributed random variables (Q2145744) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- Flow shops with reentry: reversibility properties and makespan optimal schedules (Q2282537) (← links)
- Approximation algorithms for the three-machine proportionate mixed shop scheduling (Q2283006) (← links)
- Shop scheduling problems with pliable jobs (Q2294890) (← links)
- Some positive news on the proportionate open shop problem (Q2633607) (← links)
- Dual criteria preemptive open-shop problems with minimum makespan (Q4698132) (← links)
- Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop (Q5058765) (← links)
- The LPT heuristic for minimizing total load on a proportionate openshop (Q6110607) (← links)
- On the complexity of proportionate open shop and job shop problems (Q6181381) (← links)