淡江大學機構典藏:Item 987654321/96561
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62822/95882 (66%)
Visitors : 4028529      Online Users : 572
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/96561


    Title: An Algorithm for Two-dimensional Cutting Stock Problem with Defects
    Authors: Kao, Hsiu-Hsueh;Yeh, Din-Horng;Yang, Jiun-Hung
    Contributors: 淡江大學企業管理系
    Keywords: Guillotine Cutting Stock Problem;Defective Spots;Dynamic Programming
    Date: 2013-06
    Issue Date: 2014-03-10 10:37:13 (UTC+8)
    Publisher: Taipei: Performance Measurement Association
    Abstract: In the Thin-Film Transistor and Liquid-Crystal Display (TFT-LCD) industry, LCD panels of different sizes are cut from a given glass substrate to fulfil customer orders; the manufacturer aims at reducing its production cost by minimizing the number of glass substrates used. However, in practice, glass substrates are seldom perfect and LCD panels with spots are usually treated as defective, which results in an increase in production costs. In this article we propose an algorithm for the cutting stock problem with defects; the objective is to develop an algorithm to reduce their effect.
    Relation: Journal of Accounting, Finance & Management Strategy 8(1), pp.49-67
    Appears in Collections:[Graduate Institute & Department of Business Administration] Journal Article

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML70View/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