Using a branch-and-bound and a genetic algorithm for a single-machine total late work scheduling problem.
Chin-Chia WuYunqiang YinWen-Hsiang WuHung-Ming ChenShuenn-Ren ChengPublished in: Soft Comput. (2016)
Keyphrases
- branch and bound
- single machine
- scheduling problem
- genetic algorithm
- release times
- lower bound
- branch and bound algorithm
- job shop scheduling problem
- search algorithm
- completion times
- earliness tardiness
- tabu search
- total weighted tardiness
- np hard
- branch and bound procedure
- single machine scheduling problem
- job processing times
- combinatorial optimization
- upper bound
- search space
- optimal solution
- processing times
- release dates
- setup times
- column generation
- maximum lateness
- total tardiness
- sequence dependent setup times
- metaheuristic
- flowshop
- weighted tardiness
- production scheduling
- precedence constraints
- simulated annealing
- multi objective
- scheduling jobs
- makespan minimization
- high multiplicity
- job shop
- minimizing makespan
- parallel machines
- hybrid algorithm
- evolutionary algorithm
- identical machines
- dynamic programming
- objective function