A single machine scheduling problem to minimize total early work.
Yoav Ben-YehoshuaGur MosheiovPublished in: Comput. Oper. Res. (2016)
Keyphrases
- minimize total
- single machine scheduling problem
- release dates
- weighted tardiness
- single machine
- sequence dependent setup times
- scheduling problem
- processing times
- branch and bound algorithm
- parallel machines
- precedence constraints
- total cost
- setup times
- combinatorial optimization
- flowshop
- resource consumption
- tabu search
- graphical models
- dynamic programming