A branch-and-bound procedure for a single-machine earliness scheduling problem with two agents.
Yunqiang YinChin-Chia WuWen-Hsiang WuChou-Jung HsuWen-Hung WuPublished in: Appl. Soft Comput. (2013)
Keyphrases
- single machine
- scheduling problem
- branch and bound procedure
- processing times
- branch and bound
- earliness tardiness
- maximum lateness
- total weighted tardiness
- total tardiness
- release dates
- flowshop
- minimize total
- scheduling jobs
- weighted tardiness
- setup times
- release times
- sequence dependent setup times
- np hard
- single machine scheduling problem
- tabu search
- parallel machines
- precedence constraints
- competitive ratio
- resource allocation
- weighted number of tardy jobs
- production scheduling
- search algorithm
- job shop scheduling problem
- minimizing makespan
- upper bound
- dynamic programming
- lower bound
- objective function