Optimal scheduling strategies of jobs belonging to different classes on a single machine with variable processing times.
Davide GiglioRiccardo MinciardiStefano TassaraPublished in: CDC (2003)
Keyphrases
- processing times
- single machine
- optimal scheduling
- scheduling problem
- total weighted tardiness
- scheduling jobs
- release dates
- earliness tardiness
- release times
- total tardiness
- flowshop
- setup times
- single machine scheduling problem
- maximum lateness
- minimize total
- sequence dependent setup times
- number of tardy jobs
- identical machines
- np hard
- makespan minimization
- worst case performance ratio
- learning effect
- parallel machines
- high multiplicity
- weighted number of tardy jobs
- precedence constraints
- polynomially solvable
- tabu search
- competitive ratio
- identical parallel machines
- scheduling algorithm
- number of late jobs
- production scheduling
- deteriorating jobs
- job processing times
- strongly np hard
- completion times
- evolutionary algorithm