File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Distributed project scheduling with information sharing in supply chains: Part II - Theoretical analysis and computational study

TitleDistributed project scheduling with information sharing in supply chains: Part II - Theoretical analysis and computational study
Authors
KeywordsAgent-based modelling
Distributed scheduling
Negotiation-based scheduling
Supply chain project scheduling
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. 23, p. 4899-4927 How to Cite?
AbstractThe first part of this paper (Lau, J.S.K., Huang, G.Q. and Mak, K.L., Distributed project scheduling with information sharing in supply chains: part I - agent-based negotiation algorithm. Int. J. Prod. Res. , 2005, 43, 4813-4838) has outlined the background of this research. The paper proposes and demonstrates a new negotiation-based algorithm (NEG) for solving distributed project scheduling problems (DPSP). This new algorithm not only acknowledges and accommodates the autonomy and independence of individual enterprises in making decisions in the entire supply chain, but also takes advantage of limited information shared among them to improve the quality and efficiency. This second paper will conduct a thorough theoretical analysis and computational study on the proposed algorithm. The theoretical analysis shows that the algorithm converges such that schedules of project and contractor agents do not have conflicts. The computational study reveals that NEG performs better than a centralized heuristic and contract net protocols in terms of the solution quality (e.g. total operating cost). Computational efficiency of NEG is also reasonably comparable and competitive to the extent that good quality solutions can be obtained within an affordable time limit.
Persistent Identifierhttp://hdl.handle.net/10722/74430
ISSN
2015 Impact Factor: 1.693
2015 SCImago Journal Rankings: 1.445
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorLau, JSKen_HK
dc.contributor.authorHuang, GQen_HK
dc.contributor.authorMak, KLen_HK
dc.contributor.authorLiang, Len_HK
dc.date.accessioned2010-09-06T07:01:15Z-
dc.date.available2010-09-06T07:01:15Z-
dc.date.issued2005en_HK
dc.identifier.citationInternational Journal Of Production Research, 2005, v. 43 n. 23, p. 4899-4927en_HK
dc.identifier.issn0020-7543en_HK
dc.identifier.urihttp://hdl.handle.net/10722/74430-
dc.description.abstractThe first part of this paper (Lau, J.S.K., Huang, G.Q. and Mak, K.L., Distributed project scheduling with information sharing in supply chains: part I - agent-based negotiation algorithm. Int. J. Prod. Res. , 2005, 43, 4813-4838) has outlined the background of this research. The paper proposes and demonstrates a new negotiation-based algorithm (NEG) for solving distributed project scheduling problems (DPSP). This new algorithm not only acknowledges and accommodates the autonomy and independence of individual enterprises in making decisions in the entire supply chain, but also takes advantage of limited information shared among them to improve the quality and efficiency. This second paper will conduct a thorough theoretical analysis and computational study on the proposed algorithm. The theoretical analysis shows that the algorithm converges such that schedules of project and contractor agents do not have conflicts. The computational study reveals that NEG performs better than a centralized heuristic and contract net protocols in terms of the solution quality (e.g. total operating cost). Computational efficiency of NEG is also reasonably comparable and competitive to the extent that good quality solutions can be obtained within an affordable time limit.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.subjectAgent-based modellingen_HK
dc.subjectDistributed schedulingen_HK
dc.subjectNegotiation-based schedulingen_HK
dc.subjectSupply chain project schedulingen_HK
dc.titleDistributed project scheduling with information sharing in supply chains: Part II - Theoretical analysis and computational studyen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0020-7543&volume=43&issue=23&spage=4899&epage=4927&date=2005&atitle=Distributed+project+scheduling+with+information+sharing+in+supply+chains:+part+II+-+theoretical+analysis+and+computational+studyen_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/00207540500232240en_HK
dc.identifier.scopuseid_2-s2.0-30844447704en_HK
dc.identifier.hkuros117076en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-30844447704&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume43en_HK
dc.identifier.issue23en_HK
dc.identifier.spage4899en_HK
dc.identifier.epage4927en_HK
dc.identifier.isiWOS:000233129800001-
dc.publisher.placeUnited Kingdomen_HK
dc.identifier.scopusauthoridLau, JSK=8982533400en_HK
dc.identifier.scopusauthoridHuang, GQ=7403425048en_HK
dc.identifier.scopusauthoridMak, KL=7102680226en_HK
dc.identifier.scopusauthoridLiang, L=25632675700en_HK
dc.identifier.citeulike386967-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats