Dynamic Hoist Scheduling Problem on Real-Life Electroplating Production Line

The paper describes a conducted research in order to create the scheduling system for electroplating lines. We are interested in an order driven production organization. This type of production requires scheduling in the real-time. In order to avoid costly scheduling, before the real-time system starts we prepare a set of production scenarios. We use recognition methods to select the most appropriate scenario. Selected scenarios are parameters to a heuristic scheduling algorithm called cyclogram unfolding. We present the short problem notion and algorithm steps. The real-life production line located at Wroc?aw, Poland is used to explain the algorithm step by step. We analyze the results for historical runs and generated problems. The utilization ratio is introduced in order to judge the quality of created schedules.

[1]  Dae-Won Kim,et al.  A contract net based intelligent agent system for solving the reactive hoist scheduling problem , 2006, Expert Syst. Appl..

[2]  Pengyu Yan,et al.  An algorithm for optimal cyclic scheduling in a robotic cell with flexible processing times , 2008, 2008 IEEE International Conference on Industrial Engineering and Engineering Management.

[3]  Raymond W. T. Mak,et al.  MODELING OF MATERIAL HANDLING HOIST OPERATIONS IN A PCB MANUFACTURING FACILITY , 2002 .

[4]  Jacques Lamothe,et al.  A dynamic heuristic for the real time hoist scheduling problem , 1995, Proceedings 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation. ETFA'95.

[5]  Guoqing Zhang,et al.  Optimal cyclic scheduling for printed circuit board production lines with multiple hoists and general processing sequence , 2003, IEEE Trans. Robotics Autom..

[6]  Yun Jiang,et al.  Cyclic scheduling of a single hoist in extended electroplating lines: a comprehensive integer programming solution , 2002 .

[7]  J. Świątek,et al.  Electroplating production scheduling by cyclogram unfolding in dynamic hoist scheduling problem , 2011 .

[8]  T. C. Edwin Cheng,et al.  Complexity of cyclic scheduling problems: A state-of-the-art survey , 2010, Comput. Ind. Eng..

[9]  L. W. Phillips,et al.  Mathematical Programming Solution of a Hoist Scheduling Program , 1976 .

[10]  Krzysztof Fleszar,et al.  A constraint propagation heuristic for the single-hoist, multiple-products scheduling problem , 2004, Comput. Ind. Eng..

[11]  Ralf Fröhlich,et al.  Optimal cyclic multiple hoist scheduling for processes with loops and parallel resources , 2009, 2009 IEEE International Conference on Systems, Man and Cybernetics.

[12]  Jiyin Liu,et al.  A heuristic algorithm for the two-hoist cyclic scheduling problem with overlapping hoist coverage ranges , 2008 .