Pages that link to "Item:Q1566707"

The following pages link to A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem (Q1566707):

Displaying 20 items.

• A PTAS for a particular case of the two-machine flow shop with limited machine availability (Q483257) (← links)
• An FPTAS for the parallel two-stage flowshop problem (Q507441) (← links)
• The minimum feasible tileset problem (Q666670) (← links)
• Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints (Q814116) (← links)
• Optimal scheduling of a two-stage hybrid flow shop (Q857819) (← links)
• Grouping techniques for scheduling problems: simpler and faster (Q930594) (← links)
• Two-stage proportionate flexible flow shop to minimize the makespan (Q1945694) (← links)
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
• The hybrid flow shop scheduling problem (Q2270289) (← links)
• Malleable scheduling for flows of jobs and applications to MapReduce (Q2304112) (← links)
• A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops (Q2329473) (← links)
• Optimizing resource speed for two-stage real-time tasks (Q2362234) (← links)
• A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops (Q2420659) (← links)
• Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times (Q2434321) (← links)
• Approximating the least core value and least core of cooperative games with supermodular costs (Q2445844) (← links)
• Approximation schemes for scheduling and covering on unrelated machines (Q2503309) (← links)
• An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops (Q2636494) (← links)
• A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan (Q4632189) (← links)
• A hybrid two-stage flexible flowshop scheduling problem with m identical parallel machines and a burn-in processor separately (Q5436247) (← links)
• On scheduling multiple parallel two-stage flowshops with Johnson's rule (Q6197646) (← links)