Single machine stochastic scheduling to minimize the expected number of tardy jobs using mathematical programming models.
Dong K. SeoCerry M. KleinWooseung JangPublished in: Comput. Ind. Eng. (2005)
Keyphrases
- single machine
- number of tardy jobs
- scheduling problem
- minimize total
- mathematical programming
- processing times
- single machine scheduling problem
- release dates
- release times
- maximum lateness
- flowshop
- completion times
- job processing times
- sequence dependent setup times
- scheduling jobs
- total weighted tardiness
- linear programming
- np hard
- combinatorial optimization
- deteriorating jobs
- dynamic programming
- identical machines
- precedence constraints
- job shop
- job shop scheduling problem
- tabu search