Scheduling N jobs on one machine with insert-idle-time constraints.
Yuan-geng HuangLaveen N. KanalSatish K. TripathiPublished in: IEA/AIE (1) (1989)
Keyphrases
- scheduling problem
- flowshop
- single machine
- precedence constraints
- identical machines
- parallel machines
- unrelated parallel machines
- batch processing
- sequence dependent setup times
- single machine scheduling problem
- scheduling jobs
- processing times
- release dates
- parallel machine scheduling problem
- strongly np hard
- identical parallel machines
- setup times
- maximum lateness
- job processing times
- completion times
- release times
- wafer fabrication
- minimize total
- weighted tardiness
- scheduling decisions
- minimizing makespan
- job scheduling
- resource constraints
- tardiness penalties
- tabu search
- global constraints
- job shop
- np hard
- constraint programming
- scheduling strategy
- precedence relations
- branch and bound algorithm
- scheduling algorithm
- shortest processing time
- constraint satisfaction
- preventive maintenance
- deteriorating jobs
- computational grids
- optimal scheduling
- job shop scheduling problem
- approximation algorithms
- batch processing machines