Pages that link to "Item:Q1290641"

The following pages link to Makespan minimization in open shops: A polynomial time approximation scheme (Q1290641):

Displaying 38 items.

• The three-machine proportionate open shop and mixed shop minimum makespan problems (Q319016) (← links)
• A study on several combination problems of classic shop scheduling and shortest path (Q344790) (← links)
• Approximating a two-machine flow shop scheduling under discrete scenario uncertainty (Q439320) (← links)
• A fluid approach to large volume job shop scheduling (Q600845) (← links)
• Inapproximability results for no-wait job shop scheduling. (Q703234) (← links)
• Rectangle packing with one-dimensional resource augmentation (Q834190) (← links)
• Grouping techniques for scheduling problems: simpler and faster (Q930594) (← links)
• Approximation results for flow shop scheduling problems with machine availability constraints (Q954036) (← links)
• A genetic algorithm for the proportionate multiprocessor open shop (Q1010271) (← links)
• Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop (Q1038327) (← links)
• Approximation algorithms for the multiprocessor open shop scheduling problem (Q1306353) (← links)
• Makespan minimization in preemptive two machine job shops (Q1377264) (← links)
• Approximability of two-machine no-wait flowshop scheduling with availability constraints. (Q1413925) (← links)
• Scheduling problems for parallel dedicated machines under multiple resource constraints. (Q1417559) (← links)
• Two-stage open shop scheduling with a bottleneck machine (Q1592745) (← links)
• Metaheuristics for order scheduling problem with unequal ready times (Q1727107) (← links)
• Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
• A linear time approximation scheme for makespan minimization in an open shop with release dates (Q1866011) (← links)
• Scheduling parallel dedicated machines under a single non-shared resource (Q1869718) (← links)
• Three-machine open shop with a bottleneck machine revisited (Q2061137) (← links)
• Moderate exponential-time algorithms for scheduling problems (Q2095519) (← 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)
• Open shop scheduling problem with a non-resumable flexible maintenance period (Q2150575) (← links)
• Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments (Q2215191) (← links)
• Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
• Irreducible bin packing and normality in routing open shop (Q2240719) (← links)
• Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms (Q2242051) (← links)
• A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops (Q2420659) (← 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)
• Open block scheduling in optical communication networks (Q2503353) (← 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)
• Approximation Algorithms for Generalized Path Scheduling (Q6065400) (← links)
• A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints (Q6204660) (← links)