Pages that link to "Item:Q1969835"

The following pages link to Complexity of mixed shop scheduling problems: A survey (Q1969835):

Displaying 14 items.

• 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)
• The complexity of two-job shop problems with multi-purpose unrelated machines. (Q1410331) (← links)
• Job-shop scheduling with processing alternatives. (Q1410614) (← links)
• An effective heuristic algorithm for the partial shop scheduling problem (Q1652579) (← links)
• A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints (Q1752766) (← links)
• Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
• Approximation algorithms for the three-machine proportionate mixed shop scheduling (Q2283006) (← links)
• Machine scheduling in production: a content analysis (Q2294174) (← links)
• Fair optimization and networks: a survey (Q2336590) (← links)
• A complete 4-parametric complexity classification of short shop scheduling problems (Q2434295) (← links)
• Complexity of shop-scheduling problems with fixed number of jobs: a survey (Q2460037) (← links)
• Complete Complexity Classification of Short Shop Scheduling (Q3392957) (← links)