A recovering beam search algorithm for the single machine Just-in-Time scheduling problem.
B. EsteveC. AubijouxA. ChartierVincent T'kindtPublished in: Eur. J. Oper. Res. (2006)
Keyphrases
- single machine
- scheduling problem
- search algorithm
- processing times
- earliness tardiness
- total weighted tardiness
- total tardiness
- tabu search
- minimize total
- release dates
- setup times
- maximum lateness
- np hard
- sequence dependent setup times
- scheduling jobs
- release times
- job shop scheduling
- search space
- weighted tardiness
- flowshop
- learning effect
- branch and bound
- weighted number of tardy jobs
- makespan minimization
- job shop scheduling problem
- job shop
- single machine scheduling problem
- precedence constraints
- parallel machines
- minimizing makespan
- production scheduling
- identical parallel machines
- search procedure
- special case
- lower bound
- deteriorating jobs
- genetic algorithm