Filtered and recovering beam search algorithms for the early/tardy scheduling problem with no idle time.
Jorge M. S. ValenteRui A. F. S. AlvesPublished in: Comput. Ind. Eng. (2005)
Keyphrases
- scheduling problem
- single machine
- search algorithm
- tabu search
- search algorithm for solving
- processing times
- np hard
- earliness tardiness
- flowshop
- total tardiness
- setup times
- maximum lateness
- precedence constraints
- branch and bound
- minimizing makespan
- permutation flowshop
- job shop scheduling problem
- search strategy
- heuristic search
- cross section
- sequence dependent setup times
- search methods
- path finding
- search problems
- parallel machines
- single machine scheduling problem
- tree search
- release dates
- satisfiability problem
- search strategies
- feasible solution
- neural network