排序方式: 共有92条查询结果,搜索用时 15 毫秒
91.
We consider the two‐machine open shop scheduling problem in which the jobs are brought to the system by a single transporter and moved between the processing machines by the same transporter. The purpose is to split the jobs into batches and to find the sequence of moves of the transporter so that the time by which the completed jobs are collected together on board the transporter is minimal. We present a ‐approximation algorithm. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009 相似文献
92.
设E是具有一致G -可微范数的实Banach空间 ,D是E的非空闭凸子集 ,T :D→D是非扩张映象 ,F(T)非空。设 {αn} ,{ βn}是 [0 ,1]中满足一定条件的两个序列 ,定义压缩映象St:D→D为 :St(z) =(1-t)x tTz , x ,z∈D , n≥ 1,t∈ (0 ,1) .设zt 是St 的唯一不动点 ,若当t→ 1-时 ,{zt}强收敛于某点z∈F(T) .那么 ,Reich序列 {xn}强收敛于某点z∈F(T) . 相似文献