Ant colony algorithm for multi-criteria job shop scheduling to minimize makespan, mean flow time and mean tardiness

2011 ◽  
Vol 6 (2) ◽  
pp. 116-122 ◽  
Author(s):  
Apinanthana Udomsakdigool ◽  
Voratas Khachitvichyanukul
Keyword(s):  
Ant Colony Algorithm ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Flow Time ◽  
Ant Colony ◽  
Mean Flow ◽  
Shop Scheduling ◽  
Mean Flow Time ◽  
Mean Tardiness

A New GT Heuristic for Solving Multi Objective Job Shop Scheduling Problems

2014 ◽  
Vol 591 ◽  
pp. 184-188
Author(s):  
D. Lakshmipathy ◽  
M. Chandrasekaran ◽  
T. Balamurugan ◽  
P. Sriramya
Keyword(s):  
Production Scheduling ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Heuristic Method ◽  
Flow Time ◽  
Scheduling Problems ◽  
Mean Flow ◽  
Practical Applications ◽  
Shop Scheduling ◽  
Mean Flow Time

The n-job, m-machine Job shop scheduling (JSP) problem is one of the general production scheduling problems in manufacturing system. Scheduling problems vary widely according to specific production tasks but most are NP-hard problems. Scheduling problems are usually solved using heuristics to get optimal or near optimal solutions because problems found in practical applications cannot be solved to optimality using reasonable resources in many cases. In this paper, optimization of three practical performance measures mean job flow time, mean job tardiness and makespan are considered. New Game theory based heuristic method (GT) is used for finding optimal makespan, mean flow time, mean tardiness values of different size problems. The results show that the GT Heuristic is an efficient and effective method that gives better results than Genetic Algorithm (GA). The proposed GT Heuristic is a good problem-solving technique for job shop scheduling problem with multi criteria.

scholarly journals AIS-SFHM APPROACH FOR OPTIMIZATION OF MULTI OBJECTIVE JOB SHOP PROBLEMS

2017 ◽  
Vol 13 (7) ◽  
pp. 6363-6368
Author(s):  
Chandrasekaran Manoharan
Keyword(s):  
Job Shop ◽  
Job Shop Scheduling ◽  
Hybrid Approach ◽  
Flow Time ◽  
Scheduling Problem ◽  
Scheduling Problems ◽  
Job Shop Scheduling Problem ◽  
Mean Flow ◽  
Shop Scheduling ◽  
Multi Objective

The n-job, m-machine Job shop scheduling (JSP) problem is one of the general production scheduling problems. The JSP problem is a scheduling problem, where a set of ‘n’ jobs must be processed or assembled on a set of ‘m’ dedicated machines. Each job consists of a specific set of operations, which have to be processed according to a given technical precedence order. Job shop scheduling problem is a NP-hard combinatorial optimization problem.  In this paper, optimization of three practical performance measures mean job flow time, mean job tardiness and makespan are considered. The hybrid approach of Sheep Flocks Heredity Model Algorithm (SFHM) is used for finding optimal makespan, mean flow time, mean tardiness. The hybrid SFHM approach is tested with multi objective job shop scheduling problems. Initial sequences are generated with Artificial Immune System (AIS) algorithm and results are refined using SFHM algorithm. The results show that the hybrid SFHM algorithm is an efficient and effective algorithm that gives better results than SFHM Algorithm, Genetic Algorithm (GA). The proposed hybrid SFHM algorithm is a good problem-solving technique for job shop scheduling problem with multi criteria.

Application of Ant Colony Algorithm to Job-Shop Scheduling Problem

2011 ◽  
Vol 411 ◽  
pp. 407-410
Author(s):  
Yan Cao ◽  
Lei Lei ◽  
Ya Dong Fang
Keyword(s):  
Ant Colony Algorithm ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Graph Model ◽  
Optimal Solution ◽  
Ant Colony ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling ◽  
Set Up

Production sequence of workpieces on machines, also called job-shop scheduling problem (JSP), is a focus both in academics and in practices. The research on the problem can promote theoretical progress, shorten the production cycles, improve efficiency in using resources, and strengthen market response in actual production. Ant colony optimization (ACO) is very suitable for the solving of the problem. In the paper, a disjunctive graph model of JSP is set up, which transforms the problem into a natural expression that is suitable for ACO. Then, realization steps of ACO for JSP are discussed. Finally, a 3×3 JSP problem is solved in Jbuilder X. The obtained optimal solution verifies the feasibility and effectiveness of ACO in solving JSP.

Sign in / Sign up

Export Citation Format

Share Document