English  |  正體中文  |  简体中文  |  Post-Print筆數 : 11 |  Items with full text/Total items : 88987/118697 (75%)
Visitors : 23578542      Online Users : 197
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/73512
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/73512

    Title: Scheduling unit processing time jobs on a single machine with multiple criteria
    Authors: 陳春龍
    Chen, Chuen-lung;Bulfin, Robert L.
    Contributors: 資管系
    Date: 1990
    Issue Date: 2015-02-12 14:45:16 (UTC+8)
    Abstract: We examine single machine scheduling problems when all jobs have identical processing times and there are two measures of performance. The measures of performance considered are flow-time, tardiness, number of tardy jobs, the weighted counterparts for these three measures and maximum tardiness. Using the assignment model as a basis, we provide efficient algorithms for the problem when a utility function is given, when one criterion is considered to be primary and the other one secondary. We also develop algorithms that arc polynomial in the number of nondominatcd schedules to generate all nondominated schedules. Finally, we show that the methods can easily be extended to handle more than two criteria, as well as nonzero release dales.
    Relation: Computers and Operations Research,17(1),1-7
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1016/0305-0548(90)90022-Y
    DOI: 10.1016/0305-0548(90)90022-Y
    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