Genetic algorithm and local search for just-in-time job-shop scheduling

Authors:
Rodolfo Pereira Araujo;André Gustavo dos Santos;José Elias Cláudio Arroyo
Affiliations:
Computer Science Department, Viçosa Federal University, Viçosa, MG, Brazil;Computer Science Department, Viçosa Federal University, Viçosa, MG, Brazil;Computer Science Department, Viçosa Federal University, Viçosa, MG, Brazil
Venue:
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Year:
2009

Citing 7
Cited 0

Sequencing with earliness and tardiness penalties: a review

Operations Research
Minimizing total tardiness on one machine is NP-hard

Mathematics of Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The One-Machine Problem with Earliness and Tardiness Penalties

Journal of Scheduling
Lagrangian bounds for just-in-time job-shop scheduling

Computers and Operations Research
A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems

Computers and Operations Research
Proposition of selection operation in a genetic algorithm for a job shop rescheduling problem

EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a successful combination of genetic algorithm and local search procedure to find good solutions for just-in-time job-shop scheduling problem with earliness and tardiness penalties. For each job is given a specific order of machines in which its operations must be processed, and each operation has a due date, a processing time, and earliness and tardiness penalties, which are paid if the operation is completed before or after its due date. The problem is very hard to solve to optimality even for small instances, but the proposed genetic algorithm found good solutions for some problem instances, even improving its performance when a local search procedure is invoked as an additional phase. The quality of the solutions is evaluated and compared to a set of instances from the literature, with up to 20 jobs and 10 machines. The proposed algorithm improved the solution value for most of the instances.