Pages that link to "Item:Q2356124"
From MaRDI portal
The following pages link to A cyclical search for the two machine flow shop and open shop to minimise finishing time (Q2356124):
Displayed 8 items.
- Two-machine flow shop and open shop scheduling problems with a single maintenance window (Q724106) (← links)
- A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing (Q2059090) (← links)
- Three-machine open shop with a bottleneck machine revisited (Q2061137) (← 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)
- A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time (Q5059324) (← links)
- An FPTAS for scheduling with resource constraints (Q6047696) (← links)
- Approximation algorithms for two-machine proportionate routing open shop on a tree (Q6134059) (← links)