Optimal multiple stage expansion of competence set

doi:10.1016/S0377-2217(98)00397-X

Full metadata record

DC Field	Value	Language
dc.contributor.author	Li, JM	en_US
dc.contributor.author	Chiang, CI	en_US
dc.contributor.author	Yu, PL	en_US
dc.date.accessioned	2014-12-08T15:45:45Z	-
dc.date.available	2014-12-08T15:45:45Z	-
dc.date.issued	2000-02-01	en_US
dc.identifier.issn	0377-2217	en_US
dc.identifier.uri	http://dx.doi.org/10.1016/S0377-2217(98)00397-X	en_US
dc.identifier.uri	http://hdl.handle.net/11536/30775	-
dc.description.abstract	In this paper, we consider the expansion processes of competence sets which have asymmetric cost functions, intermediate skills, and compound skills; among the skills, cyclic connections are possible. We introduce the concept of the stage expansion process (SEP) of the competence set, and provide mathematical programming methods to find a minimal cost SEP and the ordering of expansion. (C) 2000 Elsevier Science B.V. All rights reserved.	en_US
dc.language.iso	en_US	en_US
dc.subject	decision theory	en_US
dc.subject	competence set analysis	en_US
dc.subject	stage expansion process	en_US
dc.subject	expansion process	en_US
dc.subject	habitual domains	en_US
dc.title	Optimal multiple stage expansion of competence set	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1016/S0377-2217(98)00397-X	en_US
dc.identifier.journal	EUROPEAN JOURNAL OF OPERATIONAL RESEARCH	en_US
dc.citation.volume	120	en_US
dc.citation.issue	3	en_US
dc.citation.spage	511	en_US
dc.citation.epage	524	en_US
dc.contributor.department	運輸與物流管理系註：原交通所+運管所	zh_TW
dc.contributor.department	Department of Transportation and Logistics Management	en_US
dc.identifier.wosnumber	WOS:000083975600003	-
dc.citation.woscount	17	-
Appears in Collections:	Articles

Files in This Item:

000083975600003.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.