English  |  正體中文  |  简体中文  |  Items with full text/Total items : 67621/67621 (100%)
Visitors : 23029967      Online Users : 357
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/29696


    Title: SCHEDULING JOBS TO MINIMIZE TOTAL-COST
    Authors: CHEN,YL
    Contributors: 資訊管理研究所
    Keywords: ALGORITHMS
    Date: 1994
    Issue Date: 2010-06-29 20:38:28 (UTC+8)
    Publisher: 中央大學
    Abstract: The problem of preemptively scheduling a set of independent jobs with release times and deadlines to a set of parallel identical processors is a well-known scheduling problem. In this paper, we extend this famous problem by adding the consideration that the processing requirement of each job is not a fixed quantity but is a linear function of cost. We assume that the more cost we pay, the less processing requirement there is. Under this new assumption, our goal is to use the minimum cost to complete all jobs subject to their processing conditions. Two polynomial algorithms are developed for this new variant of scheduling problem.
    Relation: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
    Appears in Collections:[資訊管理研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML453View/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  - 隱私權政策聲明