Pages that link to "Item:Q3978740"

The following pages link to Two-Machine Super-Shop Scheduling Problem (Q3978740):

Displaying 10 items.

• Two-machine open-shop scheduling with rejection to minimize the makespan (Q280183) (← links)
• A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job (Q283266) (← links)
• The three-machine proportionate open shop and mixed shop minimum makespan problems (Q319016) (← links)
• A new three-machine shop scheduling: complexity and approximation algorithm (Q386427) (← links)
• Isomorphic scheduling problems (Q744639) (← links)
• Scheduling two jobs with fixed and nonfixed routes (Q1316587) (← links)
• Complexity of mixed shop scheduling problems: A survey (Q1969835) (← links)
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
• Approximation algorithms for the three-machine proportionate mixed shop scheduling (Q2283006) (← links)
• METAHEURISTICS FOR THE MIXED SHOP SCHEDULING PROBLEM (Q4650620) (← links)