作者
Saad Louaqad, Oulaid Kamach
发表日期
2016
期刊
International Journal of Computer Applications
卷号
153
期号
10
页码范围
1-7
出版商
Foundation of Computer Science
简介
This paper studies the problem of scheduling Job shops in robotic cells with no intermediate buffers, called No Wait Blocking Transport Job Shop Scheduling Problem (NWBT JSSP). This problem is an extension of the classical job shop problem. No Wait Blocking Transport job shop problems arise in many realistic production environments. To tackle this problem, we developed a Mixed Integer Linear Program and proposed a constructive heuristic based on priority rules. The MILP model has been used to solve optimally problems with as many as ten jobs, ten machines and three robots. Computational results on hypothetically generated test problems are discussed and suggestions of future research projects are proposed.
学术搜索中的文章
Mixed Integer Linear Programs for Blocking and No Wait Job Shop Scheduling Problems in Robotic cells
S Louaqad, O Kamach - International Journal of Computer Applications, 2016