Solving the cyclic job shop scheduling problem with linear precedence constraints using CP techniques.
Frédéric BoussemartGuillaume CavoryChristophe LecoutrePublished in: SMC (2) (2002)
Keyphrases
- job shop scheduling problem
- precedence constraints
- scheduling problem
- job shop scheduling
- series parallel
- combinatorial optimization
- critical path
- single machine
- branch and bound algorithm
- sequence dependent setup times
- tabu search
- total weighted tardiness
- makespan minimization
- single machine scheduling problem
- parallel machines
- release dates
- setup times
- processing times
- flowshop
- np hard
- benchmark problems
- combinatorial optimization problems
- memetic algorithm
- simulated annealing
- global constraints
- genetic algorithm
- approximation algorithms
- metaheuristic
- particle swarm optimization
- artificial bee colony
- constraint programming
- resource constrained project scheduling problem
- cost function
- similarity measure