淡江大學機構典藏:Item 987654321/114854
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62861/95882 (66%)
Visitors : 4216237      Online Users : 368
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/114854


    Title: Efficient due-date quoting and production scheduling for integrated circuit packaging with reentrant processes
    Authors: L. Y. Hsieh;C.-B. Cheng
    Keywords: Job shop scheduling;Integrated circuits;Integrated circuit packaging;Optimization;Genetic algorithms;Packaging
    Date: 2018-08
    Issue Date: 2018-08-08 12:10:45 (UTC+8)
    Publisher: IEEE
    Abstract: The advances in packaging technology in the past decade have overcome a few engineering limitations in integrated circuit (IC) manufacturing. This has greatly complicated the manufacturing process and created a huge challenge in the operations management of the semiconductor back-end production. In particular, the modern demand of lighter and smaller products expedites the multichip packaging technology, which requires reentrant processes and hence makes resource scheduling more difficult. Apart from the fact that IC packaging shares many key features with the semiconductor front-end production, the cycle time of back-end production is significantly shorter than that of the front-end production. Therefore, there is an urgent need of a rapid solution procedure to generate a reliable production schedule for IC packaging. To respond to customer requests efficiently, this paper models the production scheduling of IC packaging as an optimization model and formulates a hybrid genetic algorithm (GA) to solve the problem efficiently. The embedded structure of our model enables the decomposition of the original problems into many small-sized subproblems, which can be solved by available optimization solvers. These subproblems communicate via a master problem, which is solved by a GA to determine the due dates assigned to subproblems. The master and the subproblems are iteratively solved in turn to obtain a satisfactory solution. Computational experiments and an empirical study are performed to validate the efficiency and the feasibility of the proposed approach.
    Relation: IEEE Transactions on Components, Packaging and Manufacturing Technology 8(8), p.1487-1495
    DOI: 10.1109/TCPMT.2018.2847689
    Appears in Collections:[Graduate Institute & Department of Information Management] Journal Article

    Files in This Item:

    File Description SizeFormat
    Efficient Due-Date Quoting and Production Scheduling for Integrated Circuit Packaging With Reentrant Processes.pdf2022KbAdobe PDF0View/Open
    index.html0KbHTML215View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback