Rescheduling of unrelated parallel machines under machine breakdowns
In this paper, new repair and rescheduling algorithms are developed for the unrelated parallel machine environment. The introduced rules and algorithms are used to handle different rates of breakdowns and delays and are evaluated based on several performance measures to ensure the optimisation of both the schedule quality and stability. Schedule quality is assessed based on the schedule makespan (time to finish all jobs), and schedule stability is based on the number of shifted jobs from one machine to another and the time to match up with the original schedule after the occurrence of a breakdown. The extensive computational tests and analyses show the superiority of the proposed algorithms compared to existing methods in the literature. Moreover, the rules are ranked based on their accomplishment for different performance measure combinations, allowing the decision maker to easily determine the most appropriate repair/rescheduling rule depending on the performance measure(s) desired.
If 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 1 (2008)
Issue (Month): 1 ()
|Contact details of provider:|| Web page: http://www.inderscience.com/browse/index.php?journalID=286|
When requesting a correction, please mention this item's handle: RePEc:ids:injams:v:1:y:2008:i:1:p:75-89. 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: (Graham Langley)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.