Pages that link to "Item:Q1058969"

The following pages link to On the complexity of preemptive open-shop scheduling problems (Q1058969):

Displaying 9 items.

• Scheduling ordered open shops (Q580167) (← links)
• On the open-shop problem with preemption and minimizing the average completion time (Q703917) (← links)
• Scheduling preemptive open shops to minimize total tardiness (Q707141) (← links)
• Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival (Q1112720) (← links)
• On the complexity of preemptive openshop scheduling problems (Q1333531) (← links)
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
• An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. (Q1422367) (← links)
• Scheduling two-machine preemptive open shops to minimize total completion time (Q1885987) (← links)
• Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop (Q2389828) (← links)