Please use this identifier to cite or link to this item:
|Title:||Sequencing on single machine with general precedence constraints: the job module algorithm|
McMaster University, Faculty of Business
|Series/Report no.:||Research and working paper series (McMaster University. Faculty of Business)|
|Abstract:||<p>We introduce a class of sequencing problems based on some common, easily verifiable properties. Some well known members of this class are the Total weighted completion time problem and the Least cost fault detection problem, both with general precedence constraints. We present an efficient algorithm for solving these problems. It decomposes the original problem into smaller sub problems, called job-modules and sequences these in an optimal w ay. The main result of this paper is a polynomial-time algorithm for finding job modules in a general precedence graph.</p>|
|Description:||<p>33, , 7 leaves : ; Includes bibliographical references. ; Cover title.</p>|
|Appears in Collections:||DeGroote School of Business Working Paper Series|
Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.