On the minimization of the weighted number of tardy jobs with random processing times and deadline.
Prabuddha DeJay B. GhoshCharles E. WellsPublished in: Comput. Oper. Res. (1991)
Keyphrases
- single machine
- processing times
- weighted number of tardy jobs
- scheduling problem
- earliness tardiness
- total weighted tardiness
- release dates
- release times
- setup times
- scheduling jobs
- worst case performance ratio
- makespan minimization
- identical machines
- single machine scheduling problem
- production scheduling
- dynamic programming
- polynomially solvable
- objective function
- resource consumption
- assembly line
- precedence relations
- completion times
- resource constraints
- competitive ratio
- flowshop
- tabu search
- np hard
- cost function
- multi objective
- computational complexity
- search algorithm