Digital Library
Close Browse articles from a journal
 
<< previous    next >>
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
           All articles of the corresponding issues
                                       Details for article 5 of 33 found articles
 
 
  A combinatorial approach to a class of parallel-machine, continuous-time scheduling problems
 
 
Title: A combinatorial approach to a class of parallel-machine, continuous-time scheduling problems
Author: Kogan, Konstantin
Khmelnitsky, Eugene
Levner, Eugene
Appeared in: IIE transactions
Paging: Volume 34 (2002) nr. 3 pages 223-231
Year: 2002-03-01
Contents: The paper analyzes a manufacturing system with N non-identical, parallel machines continuously producing one product type in response to its demand. Inventory and backlog costs are incurred when tracking the demand results in inventory surpluses and shortages respectively. In addition, the production cost of a machine is incurred when the machine is not idle. The objective is to determine machine production rates so that the inventory, backlog, and production costs are minimized. For problems with demand defined as an arbitrary function of lime, numerical methods are suggested to approximate an optimal solution. The complexity of the approximation methods is polynomial, while finding an exact optimal solution requires exponential time. In a case when production is to cope with a special form of a single-mode, >K-level piece-wise constant demand, we prove, with the aid of the maximum principle, that the exact optimal solution can be found as a combination of analytical and combinatorial tools in O(>KN2(mnx{>K,2N})2) time.
Publisher: Taylor & Francis
Source file: Elektronische Wetenschappelijke Tijdschriften
 
 

                             Details for article 5 of 33 found articles
 
<< previous    next >>
 
 Koninklijke Bibliotheek - National Library of the Netherlands