A new approach to computing optimal schedules for the job-shop scheduling problem

1996 ◽  
pp. 389-403 ◽  
Author(s):  
Paul Martin ◽  
David B. Shmoys
Keyword(s):  
Job Shop ◽  
Job Shop Scheduling ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
New Approach ◽  
Shop Scheduling

Modeling and Simulation of Holonic Meta-Algorithm in Scheduling Process Using PERT Technique − Optimization in Job Shop Scheduling Problem

2015 ◽  
Vol 760 ◽  
pp. 199-204
Author(s):  
Mircea Gorgoi ◽  
Corneliu Neagu
Keyword(s):  
Objective Function ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
New Approach ◽  
Shop Scheduling ◽  
Technique Optimization ◽  
Optimum Solution

In generally scheduling can be viewed as optimization, bound by sequence and resource constrain and the minimization of the makespan is often used as the criterion. In this paper minimization of the makespan or complete time will be used such as an objective function and not the criterion of the decision. The new approach use heuristic elementary priority dispatch rules as the criterion of the decision. This research purpose a new methodology which use a specific elements of PERT techniques to find the optimum solution. New approach establish a solution's space where are find the all solution of the problem. Determination of the solution's space is realized by a meta-algorithm which take in account all the variant of the solutions of the process.

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