Pages that link to "Item:Q4744043"

The following pages link to An Algorithm for the Open-Shop Problem (Q4744043):

Displaying 18 items.

• Scheduling ordered open shops (Q580167) (← links)
• The museum visitor routing problem (Q969135) (← links)
• On the complexity of preemptive open-shop scheduling problems (Q1058969) (← links)
• Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival (Q1112720) (← links)
• The generalized shifting bottleneck procedure (Q1268190) (← links)
• Makespan minimization in open shops: A polynomial time approximation scheme (Q1290641) (← links)
• On some geometric methods in scheduling theory: A survey (Q1337673) (← links)
• Open shop scheduling with maximal machines (Q1377665) (← links)
• An iterative improvement approach for the nonpreemptive open shop scheduling problem (Q1806862) (← links)
• A polynomial-time open-shop problem with an arbitrary number of machines (Q1816373) (← 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)
• Open block scheduling in optical communication networks (Q2503353) (← links)
• Scheduling in network flow shops (Q2564878) (← links)
• Some positive news on the proportionate open shop problem (Q2633607) (← links)
• The Open Shop Scheduling Problem (Q3304098) (← links)
• Nonpreemptive open shop with restricted processing times (Q4296296) (← links)