Pages that link to "Item:Q4835387"

The following pages link to Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops (Q4835387):

Displaying 22 items.

• The three-machine proportionate open shop and mixed shop minimum makespan problems (Q319016) (← links)
• Approximating a two-machine flow shop scheduling under discrete scenario uncertainty (Q439320) (← links)
• The flow shop problem with no-idle constraints: a review and approximation (Q1027525) (← links)
• An empirical analysis of the optimality rate of flow shop heuristics (Q1027589) (← links)
• A new constructive heuristic for the flowshop scheduling problem (Q1291704) (← links)
• On some geometric methods in scheduling theory: A survey (Q1337673) (← links)
• Open shop scheduling with maximal machines (Q1377665) (← links)
• Concurrent flowshop scheduling to minimize makespan. (Q1429959) (← links)
• Heuristics for the two-stage job shop scheduling problem with a bottleneck machine (Q1569925) (← links)
• Geometrical heuristics for multiprocessor flowshop scheduling with uniform machines at each stage (Q1607975) (← links)
• Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← 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)
• An improved NEH heuristic to minimize makespan in permutation flow shops (Q2475856) (← links)
• Open block scheduling in optical communication networks (Q2503353) (← links)
• Flexible flow shop scheduling with uniform parallel machines (Q2569085) (← links)
• Performance guarantees for flowshop heuristics to minimize makespan (Q2572856) (← links)
• Some positive news on the proportionate open shop problem (Q2633607) (← links)
• The Open Shop Scheduling Problem (Q3304098) (← links)
• (Q4487091) (← links)
• A note on scheduling flowshops with flexible stage ordering (Q5925946) (← links)
• The three-stage assembly flowshop scheduling problem (Q5939973) (← links)