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 16 of 24 found articles
 
 
  Scheduling of customized jobs on a single machine under item availability
 
 
Title: Scheduling of customized jobs on a single machine under item availability
Author: Gerodimos, A. E.
Glass, C. A.
Potts, C. N.
Appeared in: IIE transactions
Paging: Volume 33 (2001) nr. 11 pages 975-984
Year: 2001-11-01
Contents: We study a problem of scheduling customized jobs on a single-machine. Each job requires two operations: one standard and one specific. Standard operations are processed in batches under item availability, and each batch requires a set-up time. Based on structural properties of the optimal solution, we introduce a generic dynamic programming scheme that builds an optimal schedule by alternately inserting blocks of operations of two distinct types. Our approach yields efficient algorithms for the sum of completion times problem with agreeable processing times and the maximum lateness problem. The number of late jobs problem is shown to be NP-hard in the ordinary sense, but is pseudo-polynomially solvable. A polynomial algorithm is also given for a special case of this problem. Our results indicate the differences between this problem and its counterpart under batch availability.
Publisher: Taylor & Francis
Source file: Elektronische Wetenschappelijke Tijdschriften
 
 

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