Selecting Jobs for Scheduling on a Machine Subject to Failure.
Wolfgang StadjePublished in: Discret. Appl. Math. (1995)
Keyphrases
- batch processing
- scheduling problem
- identical machines
- unrelated parallel machines
- parallel machines
- flowshop
- scheduling jobs
- processing times
- wafer fabrication
- parallel machine scheduling problem
- scheduling decisions
- single machine
- identical parallel machines
- release dates
- strongly np hard
- sequence dependent setup times
- job processing times
- completion times
- setup times
- precedence constraints
- maximum lateness
- weighted tardiness
- job scheduling
- minimize total
- scheduling algorithm
- open shop
- release times
- total weighted tardiness
- single machine scheduling problem
- tabu search
- np hard
- scheduling strategy
- job shop
- lower bound
- list scheduling
- optimal scheduling
- weighted sum
- minimizing makespan
- failure prediction
- tardiness penalties
- precedence relations
- polynomial time approximation
- preventive maintenance
- scheduling policies
- fixed number
- selection algorithm
- branch and bound algorithm