A hybrid genetic algorithm for no-wait job shop scheduling problems

Authors:
Jason Chao-Hsien Pan;Han-Chiang Huang
Affiliations:
Department of Business Administration, Takming University of Science and Technology, Taiwan;Department of Industrial Management, National Taiwan University of Science and Technology, Taiwan
Venue:
Expert Systems with Applications: An International Journal
Year:
2009

Citing 1
Cited 9

A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies

Computers and Industrial Engineering - Special issue on computational intelligence for industrial engineering

Multi-parent extension of partially mapped crossover for combinatorial optimization problems

Expert Systems with Applications: An International Journal
Optimizing patrol force deployment using a genetic algorithm

Expert Systems with Applications: An International Journal
Genetic regulatory network-based symbiotic evolution

Expert Systems with Applications: An International Journal
A new bee colony optimization algorithm with idle-time-based filtering scheme for open shop-scheduling problems

Expert Systems with Applications: An International Journal
A hybridization of simulated annealing and electromagnetism-like mechanism for a periodic job shop scheduling problem

Expert Systems with Applications: An International Journal
An adaptive annealing genetic algorithm for the job-shop planning and scheduling problem

Expert Systems with Applications: An International Journal
A new hybrid multi-objective Pareto archive PSO algorithm for a bi-objective job shop scheduling problem

Expert Systems with Applications: An International Journal
Production capacity planning and scheduling in a no-wait environment with controllable processing times: An integrated modeling approach

Expert Systems with Applications: An International Journal
Solving job shop scheduling problem using a hybrid parallel micro genetic algorithm

Applied Soft Computing

Quantified Score

Hi-index	12.06

Visualization

Abstract

A no-wait job shop (NWJS) describes a situation where every job has its own processing sequence with the constraint that no waiting time is allowed between operations within any job. A NWJS problem with the objective of minimizing total completion time is a NP-hard problem and this paper proposes a hybrid genetic algorithm (HGA) to solve this complex problem. A genetic operation is defined by cutting out a section of genes from a chromosome and treated as a subproblem. This subproblem is then transformed into an asymmetric traveling salesman problem (ATSP) and solved with a heuristic algorithm. Subsequently, this section with new sequence is put back to replace the original section of chromosome. The incorporation of this problem-specific genetic operator is responsible for the hybrid adjective. By doing so, the course of the search of the proposed genetic algorithm is set to more profitable regions in the solution space. The experimental results show that this hybrid genetic algorithm can accelerate the convergence and improve solution quality as well.