239
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

A dynamic scheduling algorithm for singe-arm two-cluster tools with flexible processing times

&
Pages 329-346 | Received 13 Jul 2016, Accepted 14 Mar 2017, Published online: 20 Apr 2017

References

  • Carlier, Jacques, Mohamed Haouari, Mohamed Kharbeche, and Aziz Moukrim. 2010. “An Optimization-based Heuristic for the Robotic Cell Problem.” European Journal of Operational Research 202 (3): 636–645. doi: 10.1016/j.ejor.2009.06.035
  • Chan, Wai Kin Wictor, Shengwei Ding, Jingang Yi, and Dezhen Song. 2011a. “Optimal Scheduling of Multicluster Tools with Constant Robot Moving Times, Part II: Tree-like Topology Configurations.” IEEE Transactions on Automation Science and Engineering 8 (1): 17–28. doi: 10.1109/TASE.2010.2046893
  • Chan, Wai Kin Victor, Jingang Yi, and Shengwei Ding. 2011b. “Optimal Scheduling of Multicluster Tools with Constant Robot Moving Times, Part I: Two-cluster Analysis.” IEEE Transactions on Automation Science and Engineering 8 (1): 5–16. doi: 10.1109/TASE.2010.2046891
  • Chan, Wai Kin Wictor, Jingang Yi, Shengwei Ding, and Dezhen Song. 2008. “Optimal Scheduling of K-unit Production of Cluster Tools with Single-blade Robots.” Proceedings of the 4th IEEE International Conference on Automation Science and Engineering, CASE 2008, Washigton, DC, 335–340.
  • Chauvet, Fabrice, Jean-Marie Proth, and Yorai Wardi. 2001. “Scheduling No-ait Production with Time Windows and Flexible Processing Times.” IEEE Transactions on Robotics and Automation 17 (1): 60–69. doi: 10.1109/70.917083
  • Che, Ada, Michelle Chabrol, Michel Gourgand, and Yuan Wang. 2012. “Scheduling Multiple Robots in a No-wait Re-entrant Robotic Flowshop.” International Journal of Production Economics 135 (1): 199–208. doi: 10.1016/j.ijpe.2011.07.008
  • Dawande, Milind, H. Neil Geismar, Suresh P. Sethi, and Chelliah Sriskandarajah. 2005. “Sequencing and Scheduling in Robotic Cells: Recent Developments.” Journal of Scheduling 8 (5): 387–426. doi: 10.1007/s10951-005-2861-9
  • Ding, Shengwei, Jingang Yi, and Mike Tao Zhang. 2006. “Multicluster Tools Scheduling: an Integrated Event Graph and Network Model Approach.” IEEE Transactions on Semiconductor Manufacturing 19 (3): 339–351. doi: 10.1109/TSM.2006.879414
  • Geismar, Neil, Milind Dawande, and Chelliah Sriskandarajah. 2011. “Productivity Improvement from Using Machine Buffers in Dual-gripper Cluster Tools.” IEEE Transactions on Automation Science and Engineering 8 (1): 29–41. doi: 10.1109/TASE.2009.2039567
  • Han, Yu-Yan, Dunwei Gong, and Xiaoyan Sun. 2015. “A Discrete Artificial Bee Colony Algorithm Incorporating Differential Evolution for the Flow-shop Scheduling Problem with Blocking.” Engineering Optimization 47 (7): 927–946. doi: 10.1080/0305215X.2014.928817
  • Hasani, Keramat, Svetlana A. Kravchenko, and Frank Werner. 2016. “Minimizing the Makespan for the Two-machine Scheduling Problem with a Single Server: Two Algorithms for Very Large Instances.” Engineering Optimization 48 (1): 173–183. doi: 10.1080/0305215X.2015.1005083
  • Hindi, Khalil S, and Krzysztof Fleszar. 2004. “A Constraint Propagation Heuristic for the Single-hoist, Multiple-products Scheduling Problem.” Computer and Industrial Engineering 47 (1): 91–101. doi: 10.1016/j.cie.2004.03.002
  • Kharbeche, Mohamed, and Jacques Carlier. 2010. “Exact Method for Robotic Cell Problem.” Electronic Notes in Discrete Mathematics 36: 859–866. doi: 10.1016/j.endm.2010.05.109
  • Kim, Ja-Hee, and Tae-Eog Lee. 2008. “Schedulability Analysis of Time-constrained Cluster Tools with Bounded Time Variation by an Extended Petri-net.” IEEE Transactions on Automation Science and Engineering 5 (3): 490–503. doi: 10.1109/TASE.2007.912716
  • Kim, Hyun-Jung, Jun-Ho Lee, Chihyun Jung, and Tae-Eog Lee. 2013. “Scheduling Cluster Tools with Ready Time Constraints for Consecutive Small Lots.” IEEE Transactions on Automation Science and Engineering 10 (1): 145–159. doi: 10.1109/TASE.2012.2220355
  • Lee, Jun-Ho, and Hyun-Jung Kim. 2016. “Makespan Analysis of Lot Switching Period in Cluster Tools.” IEEE Transactions on Semiconductor Manufacturing 29 (2): 127–136. doi: 10.1109/TSM.2016.2530810
  • Lee, Jun-Ho, Hyun-Jung Kim, and Tae-Eog Lee. 2013. “Scheduling Lot Switching Operations for Cluster Tools.” IEEE Transactions on Semiconductor Manufacturing 26 (4): 592–601. doi: 10.1109/TSM.2013.2281083
  • Lee, Jun-Ho, Hyun-Jung Kim, and Tae-Eog Lee. 2014. “Scheduling Cluster Tools for Concurrent Processing of Two Wafer Types.” IEEE Transactions on Automation Science and Engineering 11 (2): 525–536. doi: 10.1109/TASE.2013.2296855
  • Lee, Jun-Ho, Hyun-Jung Kim, and Tae-Eog Lee. 2015. “Scheduling Cluster Tools for Concurrent Processing of Two Wafer Types with PM Sharing.” International Journal of Production Research 53 (19): 6007–6022. doi: 10.1080/00207543.2015.1035813
  • Lee, Hwan-Yong, and Tae-Eog Lee. 2006. “Scheduling Single-armed Cluster Tools with Reentrant Wafer Flows.” IEEE Transactions on Semiconductor Manufacturing 19 (2): 226–240. doi: 10.1109/TSM.2006.873402
  • Lee, Tae-Eog, and Marc E. Posner. 1998. “Performance Measures and Schedules in Periodic job Shops.” Operations Research 45 (1): 72–91. doi: 10.1287/opre.45.1.72
  • Li, Xin, Felix T. S. Chan, and S. H. Chung. 2015. “Optimal Multi-degree Cyclic Scheduling of Multiple Robots Without Overlapping in Robotic Flowshops with Parallel Machines.” Journal of Manufacturing Systems 36: 62–75. doi: 10.1016/j.jmsy.2015.03.003
  • Li, Xin, and Richard Y. K. Fung. 2014. “A Mixed Integer Linear Programming Solution for Single Hoist Multi-degree Cyclic Scheduling with Re-entrance.” Engineering Optimization 46 (5): 704–723. doi: 10.1080/0305215X.2013.795560
  • Li, Xin, and Richard Y. K. Fung. 2016. “Optimal K-unit Cycle Scheduling of Two-cluster Tools with Residency Constraints and General Robot Moving Times.” Journal of Scheduling 19 (2): 165–176. doi: 10.1007/s10951-015-0448-7
  • Li, Xin, Richard Y. K. Fung, and Hongyi Sun. 2011. “An Events-driven Scheduling Algorithm for Two-cluster Tools with Processing Time Windows.” Proceedings of 2011 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM 2011), Singapore, 1436–1440.
  • Liu, Ming-Xiang, and Bing-Hai Zhou. 2013. “Modelling and Scheduling Analysis of Multi-cluster Tools with Residency Constraints Based on Time Constraint Sets.” International Journal of Production Research 51 (16): 4835–4852. doi: 10.1080/00207543.2013.774490
  • Nilakantan, J. Mukund, and S. G. Ponnambalam. 2016. “Robotic U-shaped Assembly Line Balancing Using Particle Swarm Optimization.” Engineering Optimization 48 (2): 231–252. doi: 10.1080/0305215X.2014.998664
  • Paul, Henrik J., Christian Bierwirth, and Herbert Kopfer. 2007. “A Heuristic Scheduling Procedure for Multi-item Hoist Production Lines.” International Journal of Production Economics 105 (1): 54–69. doi: 10.1016/j.ijpe.2005.11.008
  • Phillips, L. W., and P. S. Unger. 1976. “Mathematical Programming Solution of a Hoist Scheduling Program.” AIIE Transactions 8 (2): 219–225. doi: 10.1080/05695557608975070
  • Song, Weiwei, Zelda B. Zabinsky, and Richard L. Storch. 1993. “An Algorithm for Scheduling a Chemical Processing Tank Line.” Production Planning and Control 4 (4): 323–332. doi: 10.1080/09537289308919454
  • Van Zant, Peter. 2004. Microchip Fabrication: A Practical Guide to Semiconductor Processing. 5th ed. New York: McGraw-Hill.
  • Wu, NaiQi, Chengbin Chu, Feng Chu, and MengChu Zhou. 2008. “A Petri net Method for Schedulability and Scheduling Problems in Single-arm Cluster Tools with Wafer Residency Time Constraints.” IEEE Transactions on Semiconductor Manufacturing 21 (2): 224–237. doi: 10.1109/TSM.2008.2000425
  • Wu, NaiQi, and MengChu Zhou. 2012. “Schedulability Analysis and Optimal Scheduling of Dual-arm Cluster Tools with Residency Time Constraint and Activity Time Variation.” IEEE Transactions on Automation Science and Engineering 9 (1): 203–209. doi: 10.1109/TASE.2011.2160452
  • Yan, Pengyu, Chengbin Chu, Naiding Yang, and Ada Che. 2010. “A Branch and Bound Algorithm for Optimal Cyclic Scheduling in a Robotic Cell with Processing Time Windows.” International Journal of Production Research 48 (21): 6461–6480. doi: 10.1080/00207540903225205
  • Yang, FaJun, NaiQi Wu, Yan Qiao, and MengChu Zhou. 2014a. “Optimal One-wafer Cyclic Scheduling of Single-arm Multicluster Tools with Two-space Buffering Modules.” IEEE Transactions on Systems, Man, and Cybernetics: Systems 44 (12): 1584–1597. doi: 10.1109/TSMC.2014.2327051
  • Yang, FaJun, NaiQi Wu, Yan Qiao, and MengChu Zhou. 2014b. “Petri Net-based Polynomially Complex Approach to Optimal One-wafer Cyclic Scheduling of Hybrid Multi-cluster Tools in Semiconductor Manufacturing.” IEEE Transactions on Systems, Man, and Cybernetics: Systems 44 (12): 1598–1610. doi: 10.1109/TSMC.2014.2318679
  • Yi, Jingang, Shengwei Ding, Dezhen Song, and Mike Tao Zhang. 2008. “Steady-state Throughput and Scheduling Analysis of Multicluster Tools: A Decomposition Approach.” IEEE Transactions on Automation Science and Engineering 5 (2): 321–336. doi: 10.1109/TASE.2007.906678
  • Yih, Y. 1994. “An Algorithm for Hoist Scheduling Problems.” International Journal of Production Research 32 (3): 501–516. doi: 10.1080/00207549408956949
  • Yoon, Hyun Joong, and Doo Yong Lee. 2005. “Online Scheduling of Integrated Single-wafer Processing Tools with Temporal Constraints.” IEEE Transactions on Semiconductor Manufacturing 18 (3): 390–398. doi: 10.1109/TSM.2005.852103
  • Zhu, QingHua, NaiQi Wu, Yan Qiao, and MengChu Zhou. 2013. “Petri Net-based Optimal One-wafer Scheduling of Single-arm Multi-cluster Tools in Semiconductor Manufacturing.” IEEE Transactions on Semiconductor Manufacturing 26 (4): 578–591. doi: 10.1109/TSM.2013.2278378
  • Zhu, QingHua, NaiQi Wu, Yan Qiao, and MengChu Zhou. 2015. “Scheduling of Single-arm Multi-cluster Tools with Wafer Residency Time Constraints in Semiconductor Manufacturing.” IEEE Transactions on Semiconductor Manufacturing 28 (1): 117–125. doi: 10.1109/TSM.2014.2375880

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.