ILOG and MAS Based Framework of Job-Shop Scheduling System

Author(s):  
LiZhi Qin ◽  
QingSong Li
2012 ◽  
Vol 476-478 ◽  
pp. 2023-2027
Author(s):  
Nian Sheng Cheng

Job shop scheduling belongs to the large class of NP-complete (nondeterministic polynomial time complete) problems and the complexity of job shop scheduling characterizes many real-life situations. In auto blanking plant, intelligent scheduling system is needed to deal with the automation of production. The core structure of job shop scheduling system is designed. The scheduling rules such as mission-critical priority rule, first come first serve rule, the highest task priority rule and the urgent tasks priority rule are built with the definitions of express tasks, urgent tasks, middle urgent tasks and normal tasks according to the time features of tasks. The heuristic optimization algorithm is designed to follow the above rules. The intelligent logistics management system is built to optimize job shop scheduling in auto blanking plant.


1991 ◽  
Vol 7 (4) ◽  
pp. 341-353 ◽  
Author(s):  
Anne Collinot ◽  
Claude Le Pape

1999 ◽  
Author(s):  
Xing Zhao ◽  
Kuan H. Chen ◽  
Peter B. Luh ◽  
T. D. Chiueh ◽  
ShihChang Chang ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document