A note on a single-machine lot scheduling problem with indivisible orders.
Dar-Li YangYung-Tsung HouWen-Hung KuoPublished in: Comput. Oper. Res. (2017)
Keyphrases
- single machine
- scheduling problem
- processing times
- earliness tardiness
- total weighted tardiness
- total tardiness
- maximum lateness
- setup times
- minimize total
- sequence dependent setup times
- flowshop
- release dates
- np hard
- release times
- learning effect
- tabu search
- production scheduling
- scheduling jobs
- weighted tardiness
- precedence constraints
- minimizing makespan
- competitive ratio
- weighted number of tardy jobs
- parallel machines
- makespan minimization
- single machine scheduling problem
- dynamic programming
- job shop
- number of late jobs
- evolutionary algorithm
- job shop scheduling problem