The following pages link to The mixed shop scheduling problem (Q1067989):
Displaying 15 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)
- Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival (Q1112720) (← links)
- Scheduling two jobs with fixed and nonfixed routes (Q1316587) (← links)
- Job-shop scheduling with processing alternatives. (Q1410614) (← links)
- An effective heuristic algorithm for the partial shop scheduling problem (Q1652579) (← links)
- Two machine mixed shop scheduling problem with controllable machine speeds (Q1821024) (← 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)
- 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)
- Inhomogeneous deterministic two-stage queueing systems (Q4007322) (← links)
- METAHEURISTICS FOR THE MIXED SHOP SCHEDULING PROBLEM (Q4650620) (← links)
