Pages that link to "Item:Q1603323"
From MaRDI portal
The following pages link to The total completion time open shop scheduling problem with a given sequence of jobs on one machine (Q1603323):
Displayed 4 items.
- A new heuristic for open shop total completion time problem (Q967860) (← links)
- Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop (Q2389828) (← links)
- Heuristic constructive algorithms for open shop scheduling to minimize mean flow time (Q2482764) (← links)
- A note: maximizing the weighted number of just-in-time jobs for a given job sequence (Q6136084) (← links)