Return to search

A Lower Bound Calculationfor theN-Job, M-Machine Job Shop Scheduling Problemto Minimize Lmax

<p>An improved lower bound on Lmax is developed for the N-job, M-machine job shop scheduling problem. Improvements occur particularly on problems that are defined by a specific due date range. The procedure allows preemption on all but one machine and then identifies other delays in the processing on that machine. When a delay is found it affects the earliest starts of the remaining operations on that job and the latest finishes of the preceding operations. The delays are found by repeatedly lowering the potential value of Lmax, which, in response, may increase the lower bound. To accommodate the decreasing upper bound, (i.e. Lmax), changes in sequence are made which cause earliest starts and latest finishes to be updated. This then allows for recalculation of the lower bound. The lower bound is still determined using preemption on all but one machine, but now includes more accurate (i.e., tighter) start and finish times. <P>

Identiferoai:union.ndltd.org:NCSU/oai:NCSU:etd-19980626-112144
Date13 July 1998
CreatorsStanislaw, Natalie A.
ContributorsT.J. Hodgson, R.E. King, D.L. Bitzer
PublisherNCSU
Source SetsNorth Carolina State University
LanguageEnglish
Detected LanguageEnglish
Typetext
Formatapplication/pdf
Sourcehttp://www.lib.ncsu.edu/theses/available/etd-19980626-112144
Rightsunrestricted, I hereby certify that, if appropriate, I have obtained and attached hereto a written permission statement from the owner(s) of each third party copyrighted matter to be included in my thesis, dissertation, or project report, allowing distribution as specified below. I certify that the version I submitted is the same as that approved by my advisory committee. I hereby grant to NC State University or its agents the non-exclusive license to archive and make accessible, under the conditions specified below, my thesis, dissertation, or project report in whole or in part in all forms of media, now or hereafter known. I retain all other ownership rights to the copyright of the thesis, dissertation or project report. I also retain the right to use in future works (such as articles or books) all or part of this thesis, dissertation, or project report.

Page generated in 0.0023 seconds