Extending the Single Machine-Based Relaxation Scheme for the Job Shop Scheduling Problem.
Anis GharbiMohamed LabidiPublished in: Electron. Notes Discret. Math. (2010)
Keyphrases
- job shop scheduling problem
- single machine
- scheduling problem
- total weighted tardiness
- production scheduling
- job shop scheduling
- weighted tardiness
- makespan minimization
- lagrangian relaxation
- processing times
- job shop
- tabu search
- setup times
- benchmark instances
- sequence dependent setup times
- release dates
- minimize total
- high multiplicity
- single machine scheduling problem
- genetic algorithm
- memetic algorithm
- precedence constraints
- flowshop
- benchmark problems
- np hard
- simulated annealing
- column generation
- graph model
- neural network
- integer programming
- metaheuristic
- dynamic programming
- evolutionary computation
- shortest path
- evolutionary algorithm
- objective function