On the representation of the One Machine Sequencing Problem in the Shifting Bottleneck Heuristic
AbstractThe Shilling Bottleneck heuristic decomposes the Job Shop problem into a series of One Machine Sequencing Problems (OMSPs) with release and due dates, precedence constraints and the minimization of maximum lateness objective. It is well known that delayed precedence constraints may exist between two operations to be performed on the same machine. We identify a new type of precedence constraint that may exist in an OMSP between the predecessor of an operation and the successor of another. The premise that an OMSP captures the sequencing relationships on other machines in the release and due date information is not valid when such precedence constraints exist. A modification of the OMSP representation is proposed based on a generalized lateness objective defined on a due window. The implications of such a representation for the OMSP solution procedure have been explored.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Indian Institute of Management Ahmedabad, Research and Publication Department in its series IIMA Working Papers with number WP2004-11-01.
Date of creation:
Date of revision:
You can help add them by filling out this form.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ().
If references are entirely missing, you can add them using this form.