Metaheuristics for a job scheduling problem with smoothing costs relevant for the car industry.
Jean RespenNicolas ZuffereyEdoardo AmaldiPublished in: Networks (2016)
Keyphrases
- scheduling problem
- flowshop
- tabu search
- processing times
- makespan minimization
- tardiness penalties
- single machine
- tardiness cost
- maximum lateness
- job shop
- release dates
- limited capacity
- identical machines
- simulated annealing
- np hard
- metaheuristic
- sequence dependent setup times
- minimizing makespan
- identical parallel machines
- case study
- total weighted tardiness
- special case
- parallel machines
- completion times
- resource consumption
- precedence constraints
- job shop scheduling problem
- total cost
- parallel machine scheduling problem
- genetic algorithm
- job processing times
- scheduling jobs
- systems analysts
- multistage
- cost reduction
- particle swarm optimization
- optimization problems
- cost savings
- computational complexity
- scatter search