| 带单服务器的平行机排序问题的复杂性 |
| |
| 引用本文： | 徐春,时凌.带单服务器的平行机排序问题的复杂性[J].湖北民族学院学报(哲学社会科学版),2009,27(2). |
| |
| 作者姓名： | 徐春 时凌 |
| |
| 作者单位： | 湖北民族学院理学院,湖北恩施,445000
|
| |
| 基金项目： | 湖北省教育厅科学技术研究项目 |
| |
| 摘 要： | 研究带单服务器的两台平行机的排序问题的复杂性,每个工件在机器加工之前,必须由服务器先进行安装,在同一时刺每一个服务器只能安装一个工件,目标是使最大完工时间达到最小.在工件具有准备时间且所有加工时间等于1的条件下,证明该问题是强NP-困难的.
|
| 关 键 词： | 平行机 服务器 准备时间 复杂性 |
Complexity Result for Parallel Machine Scheduling Problem with a Single Server |
| |
| XU Chun,SHI Ling.Complexity Result for Parallel Machine Scheduling Problem with a Single Server[J].Journal of Hubei Institute for Nationalities(Natural Sciences),2009,27(2). |
| |
| Authors: | XU Chun SHI Ling |
| |
| Affiliation: | School of Science;Hubei University for Nationalities;Enshi 445000;China |
| |
| Abstract: | The complexity of parallel machine scheduling problem with a single server is studied.Setup times are considered first if a job must be loaded on a machine.We assume that all setup times have to be done by a single server,which can handle at most one job at a time.The objective is to determine a feasible schedule,which minimizes the makespan.It was proposed that all release times existed and all processing times were constant,the problem was still NP-hard in the strong sense. |
| |
| Keywords: | parallel machine server release time complexity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
