標題: On the relocation problem with a second working crew for resource recycling
作者: Lin, BMT
Huang, HL
資訊管理與財務金融系 註:原資管所+財金所
Department of Information Management and Finance
關鍵字: relocation problem;flowshop;makespan;NP-hard;heuristic algorithms;lower bound
公開日期: 15-一月-2006
摘要: In this paper, we introduce a variant of the relocation problem, which was formulated from a public house redevelopment project in Boston. In the problem of interest, given some initial resources in a common pool there is a set of jobs to be processed on a two-machine flowshop. Each job acquires a specific number of resources to start its processing and will return a number of resources to the pool at its completion. The resource consumption and resource recycle processes are performed on machine one and machine two, respectively, in a two-machine flowshop style. Abiding by the resource constraints, the problem seeks to find a feasible schedule whose makespan is minimized. In this paper, we first present NP-hardness proofs for some special cases. Three heuristic algorithms are designed to compose approximate schedules. Two lower bounds are developed and then used to test the performance of our proposed heuristics. Numerical results from computational experiments suggest that the proposed heuristics can produce quality solutions in a reasonable time.
URI: http://dx.doi.org/10.1080/10611860500411100
http://hdl.handle.net/11536/12735
ISSN: 0020-7721
DOI: 10.1080/10611860500411100
期刊: INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE
Volume: 37
Issue: 1
起始頁: 27
結束頁: 34
顯示於類別:期刊論文


文件中的檔案:

  1. 000235149000004.pdf