搜索结果: 1-3 共查到“应用数学 p-completion”相关记录3条 . 查询时间(0.062 秒)
Complexity of minimize total weighted average completion time scheduling problems with release times
flow-shop scheduling problem transportation delays
2010/9/20
The paper considers the problem of scheduling n jobs in a two-machine flow-shop to minimize the weighted sum of completion times. Between the completion of an operation and the beginning of the next o...
Singularities of the asymptotic completion of developable Möbius strips
developable Mö bius strips math
2010/11/18
We prove that the asymptotic completion of a developable M\"obius strip in Euclidean three-space must have at least one singular point other than cuspidal edge singularities. Moreover, if the strip co...
SEMI-ON-LINE SCHEDULING PROBLEMS FOR MAXIMIZING THE MINIMUM MACHINE COMPLETION TIME
On-line analysis of algorithm
2007/12/11
This paper investigates several different semi-on-line two-machine scheduling problems for maximizing the minimum machine completion time. For each problem, we propose a best possible algorithm.