Single-machine time-dependent scheduling problems with fixed rate-modifying activities and resumable jobs.
Anna AriglianoGianpaolo GhianiAntonio GriecoEmanuela GuerrieroPublished in: 4OR (2017)
Keyphrases
- single machine
- scheduling problem
- processing times
- earliness tardiness
- release times
- total weighted tardiness
- flowshop
- total tardiness
- maximum lateness
- release dates
- minimize total
- scheduling jobs
- preventive maintenance
- setup times
- weighted number of tardy jobs
- weighted tardiness
- sequence dependent setup times
- single machine scheduling problem
- identical machines
- high multiplicity
- identical parallel machines
- precedence constraints
- number of late jobs
- parallel machines
- minimizing makespan
- learning effect
- deteriorating jobs
- np hard
- completion times
- dominance rules
- strongly np hard
- production scheduling
- makespan minimization
- tabu search
- dynamic programming
- job processing times
- job shop scheduling
- competitive ratio
- job shop scheduling problem
- job shop
- special case
- shortest processing time
- asymptotic optimality
- evolutionary algorithm