Scheduling job shop associated with multiple routings with genetic and ant colony heuristics

DOI10.1080/00207540701824845zbMath1198.90182MaRDI QIDQ3055377

N. Jawahar, B. Girish

Publication date: 7 November 2010

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540701824845

zbMATH Keywords

heuristics; genetic algorithm; flexible job shop problem; ant colony optimisation; alternate routing

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Related Items

A research survey: review of flexible job shop scheduling techniques

Uses Software

• CPLEX
• Genocop

Cites Work

• Unnamed Item
• A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling.
• Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.
• Effective neighbourhood functions for the flexible job shop problem
• Routing and scheduling in a flexible job shop by tabu search
• Job shop scheduling with alternative machines
• The Complexity of Flowshop and Jobshop Scheduling
• A genetic algorithm based procedure for more realistic job shop scheduling problems
• Scheduling in a production environment with multiple process plans per job
• Algorithms for Solving Production-Scheduling Problems