An Improved Mixed Integer Programming Approach for Multi-Hoist Cyclic Scheduling Problem 種種種種種種種種種種種種種種種種種種種種種種種 一 Ada Che, Weidong Lei, Jianguang Feng, and Chengbin Chu IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, VOL. 11, NO. 1, JANUARY 2014 Student: 劉劉劉 ID number:4992C080
59
Embed
Ada Che , Weidong Lei, Jianguang Feng, and Chengbin Chu
An Improved Mixed Integer Programming Approach for Multi-Hoist Cyclic Scheduling Problem 一種改進混合整數規劃的多功能週期性排序問題的方法. Ada Che , Weidong Lei, Jianguang Feng, and Chengbin Chu IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, VOL. 11, NO . 1, JANUARY 2014 - PowerPoint PPT Presentation
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
An Improved Mixed Integer Programming Approach for
與我們的改進模型,一 更小的線性規劃求解在每個節點處,這就需要更短的 計算時間在每個節點。因此,我們的改進模型始終是更有效(在計算時間方面)比部分 改進後的模型雖然前者的 B& B 的尺寸並不總是 比後者的要小。這意味著這兩個改進在第 IV-B呈現是有效的。此外,我們還可以看到 這為 CPU 時間的部分改進模型所花費的比例 我們的改進模型通常用增加的價值 n 和 K 。因此,似乎較大的實體的大小,一般 更節省計算時間由我們的改進模型來實現。 表七顯示,多少實例為其最佳 與我們的改進模型得到的週期時間是小於 Leung 等人的模型。
第四部分
[1] V. Kats, E. Levner, and L. Meyzin, “Multiple-part cyclic hoist scheduling using a sieve method,” IEEE Trans. Robot. Autom., vol. 15, no. 4, pp. 704–713, Aug. 1999.
[2] H. Chen, C. Chu, and J.-M. Proth, “Cyclic scheduling of a hoist with time window constraints,” IEEE Trans. Robot. Autom., vol. 14, no. 1,pp. 144–152, Feb. 1998.
[3] A. Che and C. Chu, “Cyclic hoist scheduling in large real-life electroplating lines,” OR Spectr., vol. 29, no. 3, pp. 445–470, 2007.
[4] L. Lei and T. J. Wang, “The minimum common-cycle algorithm for cyclic scheduling of two material handling hoists with time window constraints,” Manage. Sci., vol. 37, no. 12, pp. 1629–1638, 1991.
[5] Y. Jiang and J. Liu, “Multihoist cyclic scheduling with fixed processing and transfer times,” IEEE Trans. Autom. Sci. Eng., vol. 4, no. 3, pp.435–450, Jul. 2007.
[6] E. Levner and V. Kats, “A parametrical critical path problem and an application for cyclic scheduling,” Discrete Appl. Math., vol. 87, no. 1,pp. 149–158, 1998.
[7] A. Che and C. Chu, “Multi-degree cyclic scheduling of two robots in a no-wait flowshop,” IEEE Trans. Autom. Sci. Eng., vol. 2, no. 2, pp.173–183, Apr. 2005
[8] E. Levner,V.Kats, D. A.L. de Pablo, andT.C.E.Cheng, “Complexity of cyclic scheduling problems: A state-of-the-art survey,” Comput. Ind.Eng., vol. 59, no. 2, pp. 352–361, 2010.
[9] V. Kats and E. Levner, “Cyclic routing algorithms in graphs: Performance analysis and applications to robot scheduling,” Comput. Ind.Eng., vol. 61, no. 2, pp. 279–288, 2011.
[10] V. Kats, “An exact optimal cyclic scheduling algorithm for multi-operator service of a production line,” Automat. Remote Contr., vol. 42,no. 4II, pp. 538–543, 1982.
[11] J. Leung, G. Zhang, X. Yang, R. Mak, and K. Lam, “Optimal cyclic multi-hoist scheduling: A mixed integer programming approach,”Oper. Res., vol. 52, no. 6, pp. 965–976, 2004.
REFERENCES參考
[12] A. Che and C. Chu, “Single-track multi-hoist scheduling problem: a collision-free resolution based on a branch and bound approach,” Int.J. Prod. Res., vol. 42, no. 12, pp. 2435–2456, 2004.
[13] J. Leung and G. Zhang, “Optimal cyclic scheduling for printed circuit board production lines with multiple hoists and general processing sequence,”IEEE Trans. Robot. Autom., vol. 19, no. 3, pp. 480–484, Jun.
2003. [14] E.Levner, V. Kats, andD. A. L. de Pablo, “Cyclic scheduling in roboticcells: An
extension of basic models in machine scheduling theory,” in Multiprocessor Scheduling: Theory and Applications. Vienna, Austria:
I-TECH Education and Publishing, 2007, pp. 1–20. [15] R. Armstrong, S. Gu, and L. Lei, “A greedy algorithm to determine the number of
transporters in a cyclic electroplating process,” IIE Trans.,vol. 28, no. 5, pp. 347–355, 1996.
[16] C. Varnier, A. Bachelu, and P. Baptiste, “Resolution of the cyclicmultihoists scheduling problem with overlapping partitions,” Information System and Operations Research (INFOR), vol. 35, no. 4, pp. 309–324,
1997. [17] D. Riera and N. Yorke-Smith, “An improved hybrid model for the generic hoist
scheduling problem,” Ann. Oper. Res., vol. 115, pp.173–191, 2002. [18] Z. Zhou and J. Liu, “A heuristic algorithm for the two-hoist cyclic scheduling problem
with overlapping hoist ranges,” IIE Trans., vol.40, no. 2008, pp. 782–794, 2008. [19] M.-A. Manier and S. Lamrous, “An evolutionary approach for the design and
scheduling of electroplating facilities,” J. Math. Model.Algor., vol. 7, no. 2, pp. 197–215, 2008.
[20] C. Bloch, M.-A. Manier, P. Baptiste, and C. Varnier, “Hoist scheduling problem,” in Production Scheduling, Chapter 8, , ser. Control Systems, Robotics and Manufacturing Series. New York, NY, USA:Wiley, 2008, pp. 193–231.
REFERENCES參考
[21] N. Wu and M. Zhou, “Modeling, analysis and control of dual-arm cluster tools with residency time constraint and activity time variation based on Petri Nets,” IEEE Trans. Autom. Sci. Eng., vol. 9, no. 2, pp.446–454, Apr. 2012.
[22] N. Wu and M. Zhou, “Schedulability analysis and optimal scheduling of dual-arm cluster tools with residency time constraint and activity time variation,” IEEE Trans. Autom. Sci. Eng., vol. 9, no. 1, pp.203–209, Jan. 2012.
[23] J. H. Kim and T. E. Lee, “Schedulability analysis of time-constrained cluster tools with bounded time variation by an extended Petri Net,”IEEE Trans. Autom. Sci. Eng., vol. 5, no. 3, pp. 490–503, Jul. 2008.
[24] L. W. Phillips and P. S. Unger, “Mathematical programming solution of a hoist scheduling program,” AIIE Trans., vol. 8, no. 2, pp. 219–225,1976.
[25] M.-A. Manier, “Contribution à l’ordonnancement cyclique du système demanutention d’une ligne de galvanoplastie,” Thèse de doctorat, Université de Franche-Comté, , France, 1994.