The following pages link to (Q4744042):
Displayed 11 items.
- Optimal results and numerical simulations for flow shop scheduling problems (Q410955) (← links)
- Dense open-shop schedules with release times (Q955015) (← links)
- Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival (Q1112720) (← links)
- Worst-case analysis of heuristics for open shops with parallel machines (Q1310023) (← links)
- On some geometric methods in scheduling theory: A survey (Q1337673) (← links)
- Reroute sequence planning in telecommunication networks and compact vector summation. (Q1428596) (← links)
- Two-stage open shop scheduling with a bottleneck machine (Q1592745) (← links)
- Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem (Q1772847) (← links)
- A polynomial-time open-shop problem with an arbitrary number of machines (Q1816373) (← links)
- A linear time approximation scheme for makespan minimization in an open shop with release dates (Q1866011) (← links)
- How good is a dense shop schedule? (Q5931907) (← links)