Dispatching Equal-Length Jobs to Parallel Machines to Maximize Throughput.
David P. BundeMichael H. GoldwasserPublished in: SWAT (2010)
Keyphrases
- parallel machines
- equal length
- scheduling problem
- unrelated parallel machines
- total tardiness
- earliness tardiness
- flowshop
- precedence constraints
- minimize total
- sequence dependent setup times
- processing times
- response time
- weighted tardiness
- setup times
- massively parallel
- release dates
- single machine
- tabu search
- parallel machine scheduling problem
- scheduling jobs
- maximum lateness
- open shop
- np hard
- parallel computing
- shared memory
- identical parallel machines
- identical machines
- job shop
- single server
- manufacturing systems
- graph cuts
- special case
- job shop scheduling problem