博碩士論文 92426007 完整後設資料紀錄

DC 欄位 語言
DC.contributor工業管理研究所zh_TW
DC.creator盧寶后zh_TW
DC.creatorBaw-Ho Luen_US
dc.date.accessioned2005-7-3T07:39:07Z
dc.date.available2005-7-3T07:39:07Z
dc.date.issued2005
dc.identifier.urihttp://ir.lib.ncu.edu.tw:444/thesis/view_etd.asp?URN=92426007
dc.contributor.department工業管理研究所zh_TW
DC.description國立中央大學zh_TW
DC.descriptionNational Central Universityen_US
dc.description.abstractIn this paper we consider the problem of scheduling n non-preemptive jobs on m identical machines with availability and eligibility constraints for minimizing the maximum lateness. That is, each machine is not continuously available at all time and each job is only allows to be processed on specified machines. Each availability interval of machines has a specific service level, and each job has to be processed at availability intervals with the service level specified or higher one. We develop a branch-and-bound algorithm to solve this scheduling problem optimally. Firstly, we propose an algorithm based on the Least Flexible Job First/ Earliest Due Date First (LFJ/EDD) rule to find the upper bound. Network flow technique is used to model the scheduling problem of the preemptive jobs into a series of base problem that is equivalent to a maximum flow problem. Then, we propose a polynomial time algorithm that combines a maximum flow algorithm and binary search procedure to solve this scheduling problem optimally and use this result as our lower bound. Computational experiments are proposed to compare the validity with complete branching method and to test the efficiency of proposed branch and bound algorithm. According to the result of computational experiment, we find that the run time of our algorithm is acceptable.en_US
DC.subjectSchedulingen_US
DC.subjectbranch and bounden_US
DC.subjectnetwork flowsen_US
DC.subjectparen_US
DC.title具機器可用時間與機器合適度限制之平行機台排程問題zh_TW
dc.language.isozh-TWzh-TW
DC.titleParallel Machine Scheduling with Machine Availability and Eligibility Constraintsen_US
DC.type博碩士論文zh_TW
DC.typethesisen_US
DC.publisherNational Central Universityen_US

若有論文相關問題,請聯絡國立中央大學圖書館推廣服務組 TEL:(03)422-7151轉57407,或E-mail聯絡  - 隱私權政策聲明