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 10 of 14 found articles
 
 
  Minimizing the Sum of Completion Times of n Jobs over m Machines in a Flowshop—A Branch and Bound Approach
 
 
Title: Minimizing the Sum of Completion Times of n Jobs over m Machines in a Flowshop—A Branch and Bound Approach
Author: Bansal, S. P.
Appeared in: IIE transactions
Paging: Volume 9 (1977) nr. 3 pages 306-311
Year: 1977-09-01
Contents: The present paper attempts to generalize the scheduling of n Jobs over m Machines when the objective is to minimize the sum of completion times of all jobs on the last machine. A modified Branch and Bound Technique has been used to solve a numerical example. Discussion and computational results of several problems are given in tabular form at the end.
Publisher: Taylor & Francis
Source file: Elektronische Wetenschappelijke Tijdschriften
 
 

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