Pruning by dominance in best-first search for the job shop Scheduling problem with total flow time

2008 ◽  
Vol 21 (1) ◽  
pp. 111-119 ◽  
Author(s):  
María R. Sierra ◽  
Ramiro Varela
Keyword(s):  
Job Shop ◽  
Job Shop Scheduling ◽  
Flow Time ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Total Flow ◽  
Total Flow Time ◽  
Shop Scheduling ◽  
Best First Search

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.

Memory Based Lamarckian Evolutionary Algorithm for Job Shop Scheduling Problem

2011 ◽  
Vol 21 (12) ◽  
pp. 3082-3093
Author(s):  
Zhu-Chang XIA ◽  
Fang LIU ◽  
Mao-Guo GONG ◽  
Yu-Tao QI
Keyword(s):  
Evolutionary Algorithm ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling
Sign in / Sign up

Export Citation Format

Share Document