English  |  正體中文  |  简体中文  |  Post-Print筆數 : 11 |  Items with full text/Total items : 88531/118073 (75%)
Visitors : 23458988      Online Users : 181
RC Version 6.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
    政大機構典藏 > 商學院 > 資訊管理學系 > 期刊論文 >  Item 140.119/75936
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/75936

    Title: Complexity of single machine, multi-criteria scheduling problems
    Authors: Chen, Chuen-lung;Bulfin, Robert L.
    Contributors: 資管系
    Keywords: Complexity;Multiple criteria;Scheduling;Single machine
    Date: 1993
    Issue Date: 2015-06-17 17:20:47 (UTC+8)
    Abstract: We examine the complexity of scheduling problems when more than one measure of performance is appropriate. The criteria we study are maximal tardiness, flowtime, number of tardy jobs, tardiness and the weighted counterparts of the last three measures. The machine environment is restricted to a single machine. Complexity results are given for secondary criterion, bicriteria and weighted criteria approaches for all combinations of measures. Of the problems examined, only six remain open.
    Relation: European Journal of Operational Research - EJOR , vol. 70, no. 1, pp. 115-125
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1016/0377-2217(93)90236-G
    DOI: 10.1016/0377-2217(93)90236-G
    Appears in Collections:[資訊管理學系] 期刊論文

    Files in This Item:

    File Description SizeFormat

    All items in 政大典藏 are protected by copyright, with all rights reserved.

    社群 sharing

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