File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1080/00207540500151507
- Scopus: eid_2-s2.0-29344449152
- WOS: WOS:000234583700001
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Distributed supply-chain project rescheduling: Part II - Distributed affected operations rescheduling algorithm
Title | Distributed supply-chain project rescheduling: Part II - Distributed affected operations rescheduling algorithm |
---|---|
Authors | |
Keywords | Affected operations rescheduling Distributed scheduling Dynamic scheduling Information sharing Supply-chain rescheduling |
Issue Date | 2006 |
Publisher | Taylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/00207543.asp |
Citation | International Journal Of Production Research, 2006, v. 44 n. 1, p. 1-25 How to Cite? |
Abstract | 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. |
Persistent Identifier | http://hdl.handle.net/10722/74395 |
ISSN | 2023 Impact Factor: 7.0 2023 SCImago Journal Rankings: 2.668 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Huang, GQ | en_HK |
dc.contributor.author | Lau, JSK | en_HK |
dc.contributor.author | Mak, KL | en_HK |
dc.contributor.author | Liang, L | en_HK |
dc.date.accessioned | 2010-09-06T07:00:54Z | - |
dc.date.available | 2010-09-06T07:00:54Z | - |
dc.date.issued | 2006 | en_HK |
dc.identifier.citation | International Journal Of Production Research, 2006, v. 44 n. 1, p. 1-25 | en_HK |
dc.identifier.issn | 0020-7543 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/74395 | - |
dc.description.abstract | 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. | en_HK |
dc.language | eng | en_HK |
dc.publisher | Taylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/00207543.asp | en_HK |
dc.relation.ispartof | International Journal of Production Research | en_HK |
dc.subject | Affected operations rescheduling | en_HK |
dc.subject | Distributed scheduling | en_HK |
dc.subject | Dynamic scheduling | en_HK |
dc.subject | Information sharing | en_HK |
dc.subject | Supply-chain rescheduling | en_HK |
dc.title | Distributed supply-chain project rescheduling: Part II - Distributed affected operations rescheduling algorithm | en_HK |
dc.type | Article | en_HK |
dc.identifier.openurl | http://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0020-7543&volume=44&issue=1&spage=1&epage=25&date=2006&atitle=Distributed+supply-chain+project+rescheduling:+part+II+-+distributed+affected+operations+rescheduling+algorithm | en_HK |
dc.identifier.email | Huang, GQ:gqhuang@hkucc.hku.hk | en_HK |
dc.identifier.email | Mak, KL:makkl@hkucc.hku.hk | en_HK |
dc.identifier.authority | Huang, GQ=rp00118 | en_HK |
dc.identifier.authority | Mak, KL=rp00154 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1080/00207540500151507 | en_HK |
dc.identifier.scopus | eid_2-s2.0-29344449152 | en_HK |
dc.identifier.hkuros | 117078 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-29344449152&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 44 | en_HK |
dc.identifier.issue | 1 | en_HK |
dc.identifier.spage | 1 | en_HK |
dc.identifier.epage | 25 | en_HK |
dc.identifier.isi | WOS:000234583700001 | - |
dc.publisher.place | United Kingdom | en_HK |
dc.identifier.scopusauthorid | Huang, GQ=7403425048 | en_HK |
dc.identifier.scopusauthorid | Lau, JSK=8982533400 | en_HK |
dc.identifier.scopusauthorid | Mak, KL=7102680226 | en_HK |
dc.identifier.scopusauthorid | Liang, L=25632675700 | en_HK |
dc.identifier.issnl | 0020-7543 | - |