English  |  正體中文  |  简体中文  |  Items with full text/Total items : 69561/69561 (100%)
Visitors : 23177918      Online Users : 395
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU 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: http://ir.lib.ncu.edu.tw/handle/987654321/31350


    Title: A branch and bound algorithm for the one-machine scheduling problem,with minimum and maximum time lags
    Authors: Sheen,Gwo-Ji;Liao,Lu-Wen
    Contributors: 工業管理研究所
    Keywords: SHIFTING BOTTLENECK PROCEDURE;JOB-SHOP PROBLEM;WINDOW CONSTRAINTS;SEQUENCING PROBLEM;PROJECT;FLOWSHOP;HYBRID
    Date: 2007
    Issue Date: 2010-07-06 17:43:31 (UTC+8)
    Publisher: 中央大學
    Abstract: We consider the one-machine scheduling problem with minimum and maximum time lags while minimizing the makespan. This problem typically arises in a manufacturing environment where the next job has to be carried out within a specific time range after the c
    Relation: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
    Appears in Collections:[工業管理研究所 ] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML617View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback  - 隱私權政策聲明