Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system.
Ling-Huey SuPublished in: Comput. Oper. Res. (2009)
Keyphrases
- parallel machines
- scheduling problem
- earliness tardiness
- total tardiness
- completion times
- release dates
- single machine
- sequence dependent setup times
- minimize total
- unrelated parallel machines
- massively parallel
- precedence constraints
- setup times
- list scheduling
- shared memory
- flowshop
- lot sizing
- scheduling jobs
- pairwise
- distributed memory
- single server
- processing times
- ibm sp