Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs.
Kunihiko HiraishiEugene LevnerMilan VlachPublished in: Comput. Oper. Res. (2002)
Keyphrases
- identical machines
- processing times
- single machine
- scheduling problem
- job scheduling
- polynomial time approximation
- scheduling jobs
- precedence constraints
- setup times
- computational complexity
- flowshop
- release dates
- fixed number
- maximum lateness
- identical parallel machines
- single machine scheduling problem
- minimize total
- computational grids
- parallel machines
- special case