English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90453/105671 (86%)
Visitors : 15386951      Online Users : 325
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

    Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/4685

    Title: Generating the best K relocation sequences in relocation problems
    Authors: M. T. Lin;S. S. Tseng
    Contributors: Department of Information Science and Applications
    Date: 1993
    Issue Date: 2009-11-30 16:03:06 (UTC+8)
    Publisher: Asia University
    Abstract: There is a set J of h jobs to be processed. For every i, job Ji demands ni units of resources and returns ai units after completion. The problem is to find the best K schedules whose resource requirements are minimum among all h! ones. In this paper, we present some important structural properties and then propose an O(h log h + hK log K) time algorithm, which runs in polynomial time if K is fixed
    Relation: European Journal of Operational Research 69(1):131-137
    Appears in Collections:[行動商務與多媒體應用學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    310904400-4685.doc37KbMicrosoft Word275View/Open

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

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