| Semi On-line Scheduling Problem for Maximizing the Minimum Machine Completion Time on mIdentical Machines |
| |
| 引用本文： | 罗润梓,孙世杰. Semi On-line Scheduling Problem for Maximizing the Minimum Machine Completion Time on mIdentical Machines[J]. 上海大学学报(英文版), 2005, 0(2) |
| |
| 作者姓名： | 罗润梓 孙世杰 |
| |
| 作者单位： | Department of Mathematics，College of Sciences，Shanghai University，Shanghai 20 0444，P.R. China，Department of Mathematics，College of Sciences，Shanghai University，Shanghai 20 0444，P.R. China |
| |
| 摘 要： | 1 Introduction In this paper, we consider a semi on line version onm identical machines M1, M2, …, Mm (m ≥3 )where the processing time of the largest job is knownin advance. A list (j1, j2, …, jn ) of jobs withprocessing times p1, p2, …, pn is given on line,which means we get the jobs one by one but both thetotal number of jobs that need to be scheduled and thesize of the jobs are not previously known. Theprocessing time of job ji becomes known only whenji-1 has…
|
Semi On-line Scheduling Problem for Maximizing the Minimum Machine Completion Time on mIdentical Machines |
| |
| LUO Run-zi,SUN Shi-jie. Semi On-line Scheduling Problem for Maximizing the Minimum Machine Completion Time on mIdentical Machines[J]. Journal of Shanghai University(English Edition), 2005, 0(2) |
| |
| Authors: | LUO Run-zi SUN Shi-jie |
| |
| Affiliation: | LUO Run-zi,SUN Shi-jie Department of Mathematics,College of Sciences,Shanghai University,Shanghai 20 0444,P.R. China |
| |
| Abstract: | |
| |
| Keywords: | scheduling semi on-line worst-case ratio. |
| 本文献已被 CNKI 等数据库收录！ |
|
