A note on "Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time".
Federico Della CroceE. DesmierThierry GaraixPublished in: Comput. Ind. Eng. (2011)
Keyphrases
- single machine
- scheduling problem
- search heuristics
- tabu search
- flowshop
- sequence dependent setup times
- scheduling jobs
- total weighted tardiness
- parallel machines
- processing times
- maximum lateness
- constraint programming
- minimizing makespan
- total tardiness
- np hard
- strongly np hard
- release dates
- setup times
- earliness tardiness
- search strategy
- completion times
- job processing times
- identical machines
- shortest processing time
- feasible solution
- search procedure
- precedence constraints
- single machine scheduling problem
- production scheduling
- search algorithm
- beam search
- weighted tardiness
- evolutionary algorithm
- job shop scheduling problem
- makespan minimization
- knapsack problem
- search strategies
- job shop
- vehicle routing problem
- constraint satisfaction
- learning algorithm
- genetic algorithm
- constraint satisfaction problems
- np complete
- approximation algorithms
- reinforcement learning
- machine learning