The Scheduling for Press Shop Based on Operation Constraints Parallel Machine Model

  • Authors:

  • Daoyuan Yu;Zhengfeng Li;Shunian Yang;Zhili Yao

  • Affiliations:

  • School of Mechanical Science and Technology, Huazhong University of Science and Technology, Wuhan, China 430074;School of Mechanical Science and Technology, Huazhong University of Science and Technology, Wuhan, China 430074;School of Mechanical Science and Technology, Huazhong University of Science and Technology, Wuhan, China 430074;DongFeng Automoblie Co., Ltd, Xiangfan, China 441004

  • Venue:
  • ICIRA '08 Proceedings of the First International Conference on Intelligent Robotics and Applications: Part II
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents the new scheduling solution for press shop and the new scheduling model based on operation constraints parallel machine for bidirectional press lines. In this new model, the jobs will be processed from the both terminals of the press line and in the order of machines, and the parallel processed jobs are under the constraints of operation number. In this paper, the constraints relative between operation and time are formulated. Then, the hybrid genetic algorithm with heuristic rules has been devised to solve the problem. In the end, an example is given in which the minimum makespan and load balance among press lines are used as the optimized objects to validate this model, and the scheduling results is obtained which possessed practical application value.