We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/General Science/Rescheduling of unrelated parallel machines under machine breakdowns
PeriodicalsGeneral Science

Rescheduling of unrelated parallel machines under machine breakdowns

Checking your access to this record.

Abstract & Overview

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.

Cite this record

Jean‐Paul Arnaout, Ghaith Rabadi (2008). Rescheduling of unrelated parallel machines under machine breakdowns. International Journal of Applied Management Science, 1(1), 75–75. https://doi.org/10.1504/ijams.2008.020040

Copy in another style

Arnaout, J., & Rabadi, G. (2008). Rescheduling of unrelated parallel machines under machine breakdowns. International Journal of Applied Management Science, 1(1), 75–75. https://doi.org/10.1504/ijams.2008.020040
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.