Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints.
Gwo-Ji SheenLu-Wen LiaoPublished in: Comput. Oper. Res. (2007)
Keyphrases
- flowshop
- maximum lateness
- identical machines
- scheduling problem
- parallel machines
- job processing times
- precedence constraints
- processing times
- completion times
- single machine
- unrelated parallel machines
- minimize total
- parallel machine scheduling problem
- identical parallel machines
- sequence dependent setup times
- wafer fabrication
- release dates
- scheduling jobs
- setup times
- strongly np hard
- special case
- job scheduling
- batch processing machines
- batch processing
- scheduling decisions
- production scheduling
- dispatching rule
- np hard
- tabu search
- manufacturing cell
- total weighted tardiness
- real time
- minimizing makespan
- fixed number
- single machine scheduling problem
- polynomial time approximation
- weighted tardiness
- shared memory
- high speed
- list scheduling
- preventive maintenance
- precedence relations
- release times
- approximation algorithms
- branch and bound algorithm
- independent and identically distributed
- constraint satisfaction