Pages that link to "Item:Q5954096"
From MaRDI portal
The following pages link to A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates. (Q5954096):
Displaying 5 items.
- A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan (Q337146) (← links)
- Optimal control of a two-server flow-shop network (Q892910) (← links)
- Two-machine flowshop scheduling in a physical examination center (Q1740429) (← links)
- An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times (Q1761212) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
