Minimizing Maximum Flowtime of Jobs with Arbitrary Parallelizability.
Kirk PruhsJulien RobertNicolas SchabanelPublished in: WAOA (2010)
Keyphrases
- flowshop
- scheduling problem
- weighted number of tardy jobs
- completion times
- single machine
- permutation flowshop
- processing times
- flowshop scheduling
- setup times
- parallel machines
- total tardiness
- precedence constraints
- website
- parallel machine scheduling problem
- sequence dependent setup times
- release dates
- np hard
- minimize total
- single machine scheduling problem
- identical machines
- job scheduling
- data mining
- database
- general conditions
- information systems
- tabu search
- upper bound
- limited capacity
- preemptive scheduling