Single machine earliness/tardiness scheduling problem with grey processing times and the grey common due date.
Oguzhan Ahmet ArikPublished in: Grey Syst. Theory Appl. (2021)
Keyphrases
- earliness tardiness
- single machine
- processing times
- scheduling problem
- release dates
- total weighted tardiness
- parallel machines
- flowshop
- release times
- single machine scheduling problem
- np hard
- setup times
- makespan minimization
- scheduling jobs
- sequence dependent setup times
- precedence constraints
- competitive ratio
- tabu search
- resource consumption
- job shop scheduling problem
- dynamic programming
- identical machines
- polynomially solvable
- tardiness cost
- job shop
- completion times
- upper bound