The following pages link to (Q4744042):
Displaying 22 items.
- Flexible open shop scheduling problem to minimize makespan (Q342284) (← links)
- A study on several combination problems of classic shop scheduling and shortest path (Q344790) (← links)
- 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)
- Three-machine open shop with a bottleneck machine revisited (Q2061137) (← 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)
- Open-shop dense schedules: properties and worst-case performance ratio (Q2434260) (← links)
- Some positive news on the proportionate open shop problem (Q2633607) (← links)
- Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms (Q3196375) (← links)
- The Open Shop Scheduling Problem (Q3304098) (← links)
- Polynomial time approximation algorithms for proportionate open‐shop scheduling (Q5246814) (← links)
- How good is a dense shop schedule? (Q5931907) (← links)
- A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints (Q6204660) (← links)
