Disjunctive graph-based scheduling algorithm for job shop with material handling

被引：0
|
作者：
Zhou B.-H. [1 ]
Zhou S.-M. [1 ]
Zhao M. [1 ]
机构：
[1] School of Mechanical Engineering, Tongji University, Shanghai
来源：
Zhou, Bing-Hai (bhzhou@tongji.edu.cn) | 2016年 / Northeast University卷 / 37期
关键词：
Disjunctive graph; Heuristic algorithm; Job Shop; Material handling; Scheduling;
D O I：
10.3969/j.issn.1005-3026.2016.01.029
中图分类号：
学科分类号：
摘要：
Take the scheduling problems of the Job Shop with material handling equipment into consideration, we established the non-linear programming model and modified disjunctive graph model. Afterwards, a two-stage structural heuristic algorithm was constructed to minimize the makespan. In the first stage, a hierarchical heuristic algorithm was constructed by dividing the disjunctive graph into sub-graphs of scheduling problems for the machines and handling equipment, respectively. The sub-graphs of scheduling problems for the machines in the upper level were solved based on a branch method, while for the handling equipment in the second level were according to the upper level results. In the second stage, a heuristic algorithm based on the block theory was presented to optimize the scheduling solutions. Finally, simulation experiments were designed and indicated that the proposed algorithm is valid and feasible. © 2016, Editorial Department of Journal of Northeastern University. All right reserved.
引用
收藏
页码：138 / 142
页数：4
相关论文
共 9 条
  • [1] Schutten J.M.J., Practical job shop scheduling, Annals of Operations Research, 83, 2, pp. 161-178, (1998)
  • [2] Hurink J., Knust S., Tabu search algorithms for job-shop problems with a single transport robot, European Journal of Operational Research, 162, 1, pp. 99-111, (2005)
  • [3] He Z.-Z., Yang Y.-J., Chen X.-D., Parallel tabu search scheduling algorithm for job-shop with transport robot, Industrial Engineering Journal, 16, 4, pp. 122-125, (2013)
  • [4] Yan P.-Y., Che A.-D., Li P., Et al., Improved genetic algorithm for robotic cell scheduling problem with flexible processing time, Computer Integrated Manufacturing Systems, 16, 2, pp. 404-410, (2010)
  • [5] Blazewicz J., Pesch E., Sterna M., Application of a modified disjunctive graph for the job shop scheduling problem, Proceedings of the Fourth International Symposium on Methods and Models in Automation and Robotics, pp. 935-940, (1997)
  • [6] Lacomme P., Larabi M., Tchernev N., Job-shop based framework for simultaneous scheduling of machines and automated guided vehicles, International Journal of Production Economics, 143, 1, pp. 24-34, (2013)
  • [7] Deroussi L., Gourgand M., Tchernev N., A simple metaheuristic approach to the simultaneous scheduling of machines and automated guided vehicles, International Journal of Production Research, 46, 8, pp. 2143-2164, (2008)
  • [8] Zhang Q., Manier H., Manier M.A., A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing time, Computers & Operations Research, 39, 7, pp. 1713-1723, (2012)
  • [9] Driessel R., Monch L., An integrated scheduling and material-handling approach for complex job shops: a computational study, International Journal of Production Research, 50, 20, pp. 5966-5985, (2012)
1