Pages that link to "Item:Q1038327"
From MaRDI portal
The following pages link to Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop (Q1038327):
Displaying 16 items.
- Flexible open shop scheduling problem to minimize makespan (Q342284) (← links)
- OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises (Q492852) (← links)
- A united search particle swarm optimization algorithm for multiobjective scheduling problem (Q611608) (← links)
- Preemptive open shop scheduling with multiprocessors: Polynomial cases and applications (Q835582) (← links)
- A polynomial algorithm for the \([n/m/0,\;t_{ij}=1,\text{ tree}/C_{\max}]\) open shop problem (Q1319570) (← links)
- Large-scale medical examination scheduling technology based on intelligent optimization (Q1740432) (← links)
- A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop (Q1792291) (← links)
- A polynomial-time open-shop problem with an arbitrary number of machines (Q1816373) (← links)
- Exponential tightness for integral-type functionals of centered independent differently distributed random variables (Q2145744) (← links)
- A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops (Q2420659) (← links)
- A tabu search approach for proportionate multiprocessor open shop scheduling (Q2450907) (← links)
- Some positive news on the proportionate open shop problem (Q2633607) (← links)
- Polynomial time approximation algorithms for proportionate open‐shop scheduling (Q5246814) (← links)
- The LPT heuristic for minimizing total load on a proportionate openshop (Q6110607) (← links)
- Approximation algorithms for two-machine proportionate routing open shop on a tree (Q6134059) (← links)
- On the complexity of proportionate open shop and job shop problems (Q6181381) (← links)
