Pages that link to "Item:Q4282281"

The following pages link to Approximation Algorithms for Three-Machine Open Shop Scheduling (Q4282281):

Displaying 21 items.

• The three-machine proportionate open shop and mixed shop minimum makespan problems (Q319016) (← links)
• Two-machine flow shop and open shop scheduling problems with a single maintenance window (Q724106) (← links)
• Dense open-shop schedules with release times (Q955015) (← links)
• Makespan minimization in open shops: A polynomial time approximation scheme (Q1290641) (← links)
• Worst-case analysis of heuristics for open shops with parallel machines (Q1310023) (← links)
• Scheduling problems for parallel dedicated machines under multiple resource constraints. (Q1417559) (← links)
• A hybrid genetic algorithm for the open shop scheduling problem (Q1576331) (← links)
• Two-stage open shop scheduling with a bottleneck machine (Q1592745) (← links)
• Polynomial time approximation algorithms for machine scheduling: Ten open problems (Q1806342) (← links)
• An iterative improvement approach for the nonpreemptive open shop scheduling problem (Q1806862) (← links)
• Three-machine open shop with a bottleneck machine revisited (Q2061137) (← links)
• A PTAS for non-resumable open shop scheduling with an availability constraint (Q2125217) (← 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)
• A tabu search approach for proportionate multiprocessor open shop scheduling (Q2450907) (← links)
• The Open Shop Scheduling Problem (Q3304098) (← links)
• Polynomial-time approximation schemes for two-machine open shop scheduling with nonavailability constraints (Q3423261) (← links)
• Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop (Q5058765) (← links)
• Polynomial time approximation algorithms for proportionate open‐shop scheduling (Q5246814) (← links)
• How good is a dense shop schedule? (Q5931907) (← links)