Loading…

Distributed supply-chain project rescheduling: part II-distributed affected operations rescheduling algorithm

Affected Operations Rescheduling (AOR) is a process of rescheduling only the operations directly and indirectly affected by a disruption through the propagation of change caused by a disruption while preserving as much as possible the robustness of the initial schedule (preschedule). AOR is basicall...

Full description

Saved in:
Bibliographic Details
Published in:International journal of production research 2006-01, Vol.44 (1), p.1-25
Main Authors: Huang, G. Q., Lau, J. S. K., Mak, K. L., Liang, L.
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Affected Operations Rescheduling (AOR) is a process of rescheduling only the operations directly and indirectly affected by a disruption through the propagation of change caused by a disruption while preserving as much as possible the robustness of the initial schedule (preschedule). AOR is basically a centralized heuristic, and thus not readily suitable for project rescheduling in a supply chain where independent and autonomous enterprises do not completely share all the relevant information between each other. This paper is mainly concerned with substantially extending AOR into a distributed version, distAOR, for distributed rescheduling. The primary emphasis of the discussion is placed upon how to deal with the research issues of enterprise autonomy and heterogeneity from the aspects of supply-chain modelling, problem formulation, and solution algorithm. The convergence of the resulting distAOR is theoretically demonstrated. The computational study reported in the first part indicates that the superior efficiency of distAOR is largely due to the fact that only minimum information is shared between enterprises, but at the cost of its lost effectiveness also due to limited information sharing.
ISSN:0020-7543
1366-588X
DOI:10.1080/00207540500151507