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 3 of 15 found articles
 
 
  A note on the proof of the complexity of the little-preemptive open-shop problem
 
 
Title: A note on the proof of the complexity of the little-preemptive open-shop problem
Author: Shchepin, Evgeny V.
Vakhania, Nodari
Appeared in: Annals of operations research
Paging: Volume 191 (2011) nr. 1 pages 251-253
Year: 2011
Contents:
Publisher: Springer US, Boston
Source file: Elektronische Wetenschappelijke Tijdschriften
 
 

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