Sequencing on single machine with general precedence constraints: the job module algorithm

dc.contributor.author	Steiner, George	en_US
dc.contributor.author	McMaster University, Faculty of Business	en_US
dc.date.accessioned	2014-06-17T20:41:02Z
dc.date.available	2014-06-17T20:41:02Z
dc.date.created	2013-12-23	en_US
dc.date.issued	1983-06	en_US
dc.description	<p>33, [14], 7 leaves : ; Includes bibliographical references. ; Cover title.</p>	en_US
dc.description.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>	en_US
dc.identifier.other	dsb/144	en_US
dc.identifier.other	1143	en_US
dc.identifier.other	4944167	en_US
dc.identifier.uri	http://hdl.handle.net/11375/5485
dc.relation.ispartofseries	Research and working paper series (McMaster University. Faculty of Business)	en_US
dc.relation.ispartofseries	no. 209	en_US
dc.subject	Business	en_US
dc.subject	Business	en_US
dc.subject.lcc	Production scheduling > Mathematical models Production planning > Mathematical models	en_US
dc.title	Sequencing on single machine with general precedence constraints: the job module algorithm	en_US
dc.type	article	en_US

Files

Now showing 1 - 1 of 1