The following pages link to Scheduling ordered open shops (Q580167):
Displaying 20 items.
- The two-machine no-wait general and proportionate open shop makespan problem (Q296784) (← links)
- The three-machine proportionate open shop and mixed shop minimum makespan problems (Q319016) (← links)
- OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises (Q492852) (← links)
- On the open-shop problem with preemption and minimizing the average completion time (Q703917) (← links)
- Scheduling preemptive open shops to minimize total tardiness (Q707141) (← links)
- A multi-level genetic algorithm for a multi-stage space allocation problem (Q984123) (← links)
- On the complexity of preemptive openshop scheduling problems (Q1333531) (← links)
- Open shop scheduling with maximal machines (Q1377665) (← links)
- An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. (Q1422367) (← links)
- Flow shop and open shop scheduling with a critical machine and two operations per job (Q1590807) (← links)
- Scheduling two-machine preemptive open shops to minimize total completion time (Q1885987) (← links)
- Exponential tightness for integral-type functionals of centered independent differently distributed random variables (Q2145744) (← 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)
- Approximation algorithms for the three-machine proportionate mixed shop scheduling (Q2283006) (← links)
- Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop (Q2389828) (← links)
- Some positive news on the proportionate open shop problem (Q2633607) (← links)
- Two-machine open shop scheduling with secondary criteria (Q3044040) (← links)
- Proportionate flow shop: New complexity results and models with due date assignment (Q5249462) (← links)
- The LPT heuristic for minimizing total load on a proportionate openshop (Q6110607) (← links)
