File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Distributed supply-chain project rescheduling: Part i - Impacts of information-sharing strategies

TitleDistributed supply-chain project rescheduling: Part i - Impacts of information-sharing strategies
Authors
KeywordsAdaptive scheduling
Distributed scheduling
Information sharing
Rescheduling
Supply chain
Issue Date2005
PublisherTaylor & 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, 2005, v. 43 n. 24, p. 5107-5129 How to Cite?
AbstractA supply-chain project normally involves a number of independent and autonomous enterprises that share information to varying levels. The initial project schedule (preschedule) established at the time of forming the supply-chain often requires a series of amendments due to unexpected or abrupt disturbances such as temporary resource outage (e.g. machine break), arrival or cancellation of orders from customers, and change in an operation's processing time (e.g. rework). Rescheduling or adaptive scheduling is a process of updating/repairing the preschedule to adapt to the disturbances. Appropriate rescheduling methods must be chosen and applied depending on the specific protocol of sharing information agreed between the enterprises in the supply chain. This paper is concerned with the impacts of different levels of information sharing on the performance of supply-chain project rescheduling problems. Three rescheduling methods are examined in the research. They are distributed AOR (Affected Operations Rescheduling), negotiation-based rescheduling (NEG), and centralized total rescheduling (TR). These three rescheduling algorithms represent three typical information-sharing scenarios: little information sharing, limited information sharing and complete information sharing, respectively. A comprehensive computational study is conducted under different experimental settings. The results show that NEG and distAOR outperforms the TR rescheduling in terms of total cost minimization and stability of schedule and contractual relationship. NEG is superior in both rescheduling efficiency and effectiveness due to the effect of a moderate level of information sharing.
Persistent Identifierhttp://hdl.handle.net/10722/74241
ISSN
2015 Impact Factor: 1.693
2015 SCImago Journal Rankings: 1.445
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorHuang, GQen_HK
dc.contributor.authorLau, JSKen_HK
dc.contributor.authorMak, KLen_HK
dc.contributor.authorLiang, Len_HK
dc.date.accessioned2010-09-06T06:59:21Z-
dc.date.available2010-09-06T06:59:21Z-
dc.date.issued2005en_HK
dc.identifier.citationInternational Journal Of Production Research, 2005, v. 43 n. 24, p. 5107-5129en_HK
dc.identifier.issn0020-7543en_HK
dc.identifier.urihttp://hdl.handle.net/10722/74241-
dc.description.abstractA supply-chain project normally involves a number of independent and autonomous enterprises that share information to varying levels. The initial project schedule (preschedule) established at the time of forming the supply-chain often requires a series of amendments due to unexpected or abrupt disturbances such as temporary resource outage (e.g. machine break), arrival or cancellation of orders from customers, and change in an operation's processing time (e.g. rework). Rescheduling or adaptive scheduling is a process of updating/repairing the preschedule to adapt to the disturbances. Appropriate rescheduling methods must be chosen and applied depending on the specific protocol of sharing information agreed between the enterprises in the supply chain. This paper is concerned with the impacts of different levels of information sharing on the performance of supply-chain project rescheduling problems. Three rescheduling methods are examined in the research. They are distributed AOR (Affected Operations Rescheduling), negotiation-based rescheduling (NEG), and centralized total rescheduling (TR). These three rescheduling algorithms represent three typical information-sharing scenarios: little information sharing, limited information sharing and complete information sharing, respectively. A comprehensive computational study is conducted under different experimental settings. The results show that NEG and distAOR outperforms the TR rescheduling in terms of total cost minimization and stability of schedule and contractual relationship. NEG is superior in both rescheduling efficiency and effectiveness due to the effect of a moderate level of information sharing.en_HK
dc.languageengen_HK
dc.publisherTaylor & Francis Ltd. The Journal's web site is located at http://www.tandf.co.uk/journals/titles/00207543.aspen_HK
dc.relation.ispartofInternational Journal of Production Researchen_HK
dc.subjectAdaptive schedulingen_HK
dc.subjectDistributed schedulingen_HK
dc.subjectInformation sharingen_HK
dc.subjectReschedulingen_HK
dc.subjectSupply chainen_HK
dc.titleDistributed supply-chain project rescheduling: Part i - Impacts of information-sharing strategiesen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0020-7543&volume=43&issue=24&spage=5107&epage=5129&date=2005&atitle=Distributed+supply-chain+project+rescheduling:+part+I+-+impacts+of+information-sharing+strategiesen_HK
dc.identifier.emailHuang, GQ:gqhuang@hkucc.hku.hken_HK
dc.identifier.emailMak, KL:makkl@hkucc.hku.hken_HK
dc.identifier.authorityHuang, GQ=rp00118en_HK
dc.identifier.authorityMak, KL=rp00154en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1080/00207540500151564en_HK
dc.identifier.scopuseid_2-s2.0-29344465790en_HK
dc.identifier.hkuros117077en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-29344465790&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume43en_HK
dc.identifier.issue24en_HK
dc.identifier.spage5107en_HK
dc.identifier.epage5129en_HK
dc.identifier.isiWOS:000233565800001-
dc.publisher.placeUnited Kingdomen_HK
dc.identifier.scopusauthoridHuang, GQ=7403425048en_HK
dc.identifier.scopusauthoridLau, JSK=8982533400en_HK
dc.identifier.scopusauthoridMak, KL=7102680226en_HK
dc.identifier.scopusauthoridLiang, L=25632675700en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats