OPTIMIZING THE FLEXIBLE JOB-SHOP SCHEDULING PROBLEM USING HYBRIDIZED GENETIC ALGORITHMS

OPTIMIZING THE FLEXIBLE JOB-SHOP SCHEDULING PROBLEM USING HYBRIDIZED GENETIC ALGORITHMS

Show other versions (1)

Flexible job-shop scheduling problem (FJSP) is a generalization of the classical job-shop scheduling problem (JSP). It takes shape when alternative production routing is allowed in the classical job-shop. However, production scheduling becomes very complex as the number of jobs, operations, parts an...

Full description

Bibliographic Details
Main Author: Al-Hinai, Nasr
Other Authors: ElMekkawy, Tarek (Mechanical and Manufacturing Engineering)
Published: Flexible Services and Manufacturing Journal 2011
Subjects:
Scheduling
Job-Shop
Breakdown
genetic algorithm
Online Access:http://hdl.handle.net/1993/4955

Internet

http://hdl.handle.net/1993/4955

Similar Items