带装载和卸载平行机调度问题-物流工程专业论文.docx

浙江理工大学硕士专业学位论文带装载和卸载的平行机调度问题 浙江理工大学硕士专业学位论文 带装载和卸载的平行机调度问题 II II 万方数据 最优调度，那么这个调度也是合理的。这节就使用LP T 算法尝试解决该问题。通过几个 具体的实例，分别使用随机算法R和LP T 算法来对这些进入到配送中心的卡车进行调度安 排，得到进入卡车的调度和相应的包裹流，再把用随机算法R得到的结果和用LP T 算法 得到的结果与最优解值进行比较，找到最坏情况界，得出LP T 算法可以有效地解决该问 题。 第五章是对全文的总结以及对未来的展望。 关键词： 调度；算法；最坏情况界；最大完工时间；配送中心；包裹运输 PAGE III PAGE III 万方数据 Abstract In this thesis, we study the scheduling problem in which jobs are processed on two identical parallel machines that share servers which loads and unloads jobs on them. For this kind of problem, the general research is that the server only charge the loading operation. But along with the development of automation, it is worthy of study in the actual production operation that each job has to be loaded by a server before being processed on the machine and unload immediately by a server after its processing. Due to the increase of one operation, it is also increase the di?culty in algorithm design. So, ?rst, we study a preemptive variant with only one server. Second, we study a non-preemptive variant with two servers. Third, we introduce a practical application: a scheduling problem about parcels that is very common in the distribution center. The Longest Processing Times(LP T ) algorithm is presented to solve this problem. We compare the results between the random algorithm R, LP T and the optimal algorithm and ?nd LP T can solve this problem e?ectively. The thesis is organized as follows: In chapter 1, we brie?y introduce the basic theory and background of the scheduling, algorithm design and analysis of the scheduling problem. By using worst case ratio to measure the e?ectiveness. And we also brie?y introduce the research status about scheduling problems with common serves at home and abroad. In chapter 2, we study the preemptive variant with only one server with the object to minimize the makespan. Each job has to be loaded by the server before being processed on one of the machine and unloaded by the server after its processing. T