IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v5y2013i11p4637-4652d30172.html
   My bibliography  Save this article

A Systematic Cycle Time Reduction Procedure for Enhancing the Competitiveness and Sustainability of a Semiconductor Manufacturer

Author

Listed:
  • Toly Chen

    (Department of Industrial Engineering and Systems Management, Feng Chia University, 100, Wenhwa Road, Seatwen, Taichung City 407, Taiwan)

Abstract

Cycle time reduction plays an important role in improving the competitiveness and sustainability of a semiconductor manufacturer. However, in the past, cycle time reduction was usually unplanned owing to the lack of a systematic and quantitative procedure. To tackle this problem, a systematic procedure was established in this study for planning cycle time reduction actions to enhance the competitiveness and sustainability of a semiconductor manufacturer. First, some controllable factors that are influential to the job cycle time are identified. Subsequently, the relationship between the controllable factors and the job cycle time is fitted with a back propagation network. Based on this relationship, actions to shorten the job cycle time can be planned. The feasibility and effectiveness of an action have to be assessed before it can be taken in practice. An example containing the real data of hundreds of jobs has been used to illustrate the applicability of the proposed methodology. In addition, the financial benefits of the cycle time reduction action were analyzed, which provided the evidence that the proposed methodology enabled the sustainable development of the semiconductor manufacturer, since capital adequacy is very important in the semiconductor manufacturing industry.

Suggested Citation

  • Toly Chen, 2013. "A Systematic Cycle Time Reduction Procedure for Enhancing the Competitiveness and Sustainability of a Semiconductor Manufacturer," Sustainability, MDPI, vol. 5(11), pages 1-16, November.
    • Handle: RePEc:gam:jsusta:v:5:y:2013:i:11:p:4637-4652:d:30172
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/5/11/4637/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/5/11/4637/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Nazzal, Dima & Mollaghasemi, Mansooreh & Anderson, Dave, 2006. "A simulation-based evaluation of the cost of cycle time reduction in Agere Systems wafer fabrication facility--a case study," International Journal of Production Economics, Elsevier, vol. 100(2), pages 300-313, April.
    2. S. Thomas McCormick & Michael L. Pinedo & Scott Shenker & Barry Wolf, 1989. "Sequencing in an Assembly Line with Blocking to Minimize Cycle Time," Operations Research, INFORMS, vol. 37(6), pages 925-935, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Fengyi Lin & Sheng-Wei Lin & Wen-Min Lu, 2018. "Sustainability Assessment of Taiwan’s Semiconductor Industry: A New Hybrid Model Using Combined Analytic Hierarchy Process and Two-Stage Additive Network Data Envelopment Analysis," Sustainability, MDPI, vol. 10(11), pages 1-16, November.
    2. Toly Chen, 2014. "Strengthening the Competitiveness and Sustainability of a Semiconductor Manufacturer with Cloud Manufacturing," Sustainability, MDPI, vol. 6(1), pages 1-16, January.
    3. Toly Chen & Yu-Cheng Wang, 2014. "Enhancing the Effectiveness of Cycle Time Estimation in Wafer Fabrication-Efficient Methodology and Managerial Implications," Sustainability, MDPI, vol. 6(8), pages 1-22, August.
    4. Toly Chen & Hsin-Chieh Wu, 2017. "A new cloud computing method for establishing asymmetric cycle time intervals in a wafer fabrication factory," Journal of Intelligent Manufacturing, Springer, vol. 28(5), pages 1095-1107, June.
    5. Waleed Rashad & Zlatko Nedelko, 2020. "Global Sourcing Strategies: A Framework for Lean, Agile, and Leagile," Sustainability, MDPI, vol. 12(17), pages 1-29, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Smith, Kate & Palaniswami, M. & Krishnamoorthy, M., 1996. "Traditional heuristic versus Hopfield neural network approaches to a car sequencing problem," European Journal of Operational Research, Elsevier, vol. 93(2), pages 300-316, September.
    2. Pempera, Jaroslaw & Smutnicki, Czeslaw, 2018. "Open shop cyclic scheduling," European Journal of Operational Research, Elsevier, vol. 269(2), pages 773-781.
    3. Herbon, Avi, 2020. "An approximated solution to the constrained integrated manufacturer-buyer supply problem," Operations Research Perspectives, Elsevier, vol. 7(C).
    4. Kats, Vladimir & Lei, Lei & Levner, Eugene, 2008. "Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1196-1211, June.
    5. Ronconi, Débora P. & Henriques, Luís R.S., 2009. "Some heuristic algorithms for total tardiness minimization in a flowshop with blocking," Omega, Elsevier, vol. 37(2), pages 272-281, April.
    6. Lin, Shih-Wei & Ying, Kuo-Ching, 2013. "Minimizing makespan in a blocking flowshop using a revised artificial immune system algorithm," Omega, Elsevier, vol. 41(2), pages 383-389.
    7. Smutnicki, Czeslaw & Pempera, Jaroslaw & Bocewicz, Grzegorz & Banaszak, Zbigniew, 2022. "Cyclic flow-shop scheduling with no-wait constraints and missing operations," European Journal of Operational Research, Elsevier, vol. 302(1), pages 39-49.
    8. Bolat, Ahmet, 1997. "Sequencing jobs for an automated manufacturing module with buffer," European Journal of Operational Research, Elsevier, vol. 96(3), pages 622-635, February.
    9. Julka, Nirupam & Baines, Tim & Tjahjono, Benny & Lendermann, Peter & Vitanov, Val, 2007. "A review of multi-factor capacity expansion models for manufacturing plants: Searching for a holistic decision aid," International Journal of Production Economics, Elsevier, vol. 106(2), pages 607-621, April.
    10. J M Framinan & J N D Gupta & R Leisten, 2004. "A review and classification of heuristics for permutation flow-shop scheduling with makespan objective," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(12), pages 1243-1255, December.
    11. Sawik, Tadeusz, 2004. "Loading and scheduling of a flexible assembly system by mixed integer programming," European Journal of Operational Research, Elsevier, vol. 154(1), pages 1-19, April.
    12. I.N. Kamal Abadi & Nicholas G. Hall & Chelliah Sriskandarajah, 2000. "Minimizing Cycle Time in a Blocking Flowshop," Operations Research, INFORMS, vol. 48(1), pages 177-180, February.
    13. Ahmet Bolat, 1997. "Efficient methods for sequencing minimum job sets on mixed model assembly lines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(5), pages 419-437, August.
    14. Mascis, Alessandro & Pacciarelli, Dario, 2002. "Job-shop scheduling with blocking and no-wait constraints," European Journal of Operational Research, Elsevier, vol. 143(3), pages 498-517, December.
    15. George J. Kyparisis & Christos Koulamas, 2002. "Assembly-Line Scheduling with Concurrent Operations and Parallel Machines," INFORMS Journal on Computing, INFORMS, vol. 14(1), pages 68-80, February.
    16. Zhichao Feng & Milind Dawande & Ganesh Janakiraman, 2021. "On the Capacity of a Process with Batch Processing and Setup Times," Production and Operations Management, Production and Operations Management Society, vol. 30(11), pages 4273-4287, November.
    17. Grabowski, Jøzef & Pempera, Jaroslaw, 2007. "The permutation flow shop problem with blocking. A tabu search approach," Omega, Elsevier, vol. 35(3), pages 302-311, June.
    18. Bagchi, Tapan P. & Gupta, Jatinder N.D. & Sriskandarajah, Chelliah, 2006. "A review of TSP based approaches for flowshop scheduling," European Journal of Operational Research, Elsevier, vol. 169(3), pages 816-854, March.
    19. Ricardo Soto & Broderick Crawford & Rodrigo Olivares & César Carrasco & Eduardo Rodriguez-Tello & Carlos Castro & Fernando Paredes & Hanns de la Fuente-Mella, 2020. "A Reactive Population Approach on the Dolphin Echolocation Algorithm for Solving Cell Manufacturing Systems," Mathematics, MDPI, vol. 8(9), pages 1-25, August.
    20. Ahmed Ghoniem & Tulay Flamand & Mohamed Haouari, 2016. "Optimization-Based Very Large-Scale Neighborhood Search for Generalized Assignment Problems with Location/Allocation Considerations," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 575-588, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jsusta:v:5:y:2013:i:11:p:4637-4652:d:30172. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.