Non-clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times.
Alexander MäckerManuel MalatyaliFriedhelm Meyer auf der HeideSören RiechersPublished in: WAOA (2017)
Keyphrases
- setup times
- max flow
- scheduling problem
- flowshop
- unrelated parallel machines
- manufacturing cell
- completion times
- parallel machines
- sequence dependent setup times
- single machine scheduling problem
- single machine
- minimize total
- processing times
- energy minimization
- identical machines
- precedence constraints
- multi item
- lot sizing
- tabu search
- graph cuts
- release dates
- scheduling algorithm
- single server
- cell formation
- image reconstruction
- special case
- multistage
- parallel computing
- state space
- knapsack problem