On the representation of the One Machine Sequencing Problem in the Shifting Bottleneck Heuristic
The 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.
|Date of creation:|
|Date of revision:|
|Contact details of provider:|| Phone: 91 79 2630 7241|
Fax: 91 79 2630 6896
Web page: http://www.iimahd.ernet.in/publications
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:iim:iimawp:wp01855. See general information about how to correct material in RePEc.
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.