期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
Cooperative Game Theory Based Coordinated Scheduling of Two-Machine Flow-Shop and Transportation
1
作者 SUN Wenjuan GONG Hua LIU Peng 《Journal of Systems Science & Complexity》 SCIE EI CSCD 2023年第6期2415-2433,共19页
A cooperative game theoretical approach is taken to production and transportation coordinated scheduling problems of two-machine flow-shop(TFS-PTCS problems)with an interstage transporter.The authors assume that there... A cooperative game theoretical approach is taken to production and transportation coordinated scheduling problems of two-machine flow-shop(TFS-PTCS problems)with an interstage transporter.The authors assume that there is an initial scheduling order for processing jobs on the machines.The cooperative sequencing game models associated with TFS-PTCS problems are established with jobs as players and the maximal cost savings of a coalition as its value.The properties of cooperative games under two different types of admissible rearrangements are analysed.For TFS-PTCS problems with identical processing time,it is proved that,the corresponding games areσ_(0)-component additive and convex under one admissible rearrangement.The Shapley value gives a core allocation,and is provided in a computable form.Under the other admissible rearrangement,the games neither need to beσ_(0)-component additive nor convex,and an allocation rule of modified Shapley value is designed.The properties of the cooperative games are analysed by a counterexample for general problems. 展开更多
关键词 Cooperative sequencing games core allocation production and transportation coordinated scheduling Shapley value two-machine flow-shop
原文传递
Makespan Minimization in Two-Machine Flow-Shop Scheduling under No-wait and Deterministic Unavailable Interval Constraints 被引量:1
2
作者 Kejia Chen Debiao Li Xiao Wang 《Journal of Systems Science and Systems Engineering》 SCIE EI CSCD 2020年第4期400-411,共12页
This paper systematically studies the two machine flow-shop scheduling problems with no-wait and deterministic unavailable interval constraints.To minimize the makespan,three integer programming mathematical models ar... This paper systematically studies the two machine flow-shop scheduling problems with no-wait and deterministic unavailable interval constraints.To minimize the makespan,three integer programming mathematical models are formulated for two-machine flow-shop with no-wait constraint,two-machine flow-shop with resumable unavailable interval constraint,and two-machine flow-shop with no-wait and non-resumable unavailable interval constraints problems,respectively.The optimal conditions of solv-ing the two-machine flow-shop with no-wait constraint problem by the permutation schedules,the two-machine flow-shop with resumable unavailable interval constraint problem by the Johnson algorithm,and two-machine flow-shop with no-wait and non-resumable unavailable interval constraints problem by the Gilmore and Gomory Algorithm(GGA)are presented,respectively.And the tight worst-case performance bounds of Johnson and GGA algorithms for these problems are also proved to be 2.Several instances are generated to demonstrate the proposed theorems.Based on the experimental results,GGA obtains the optimal solution for the two-machine flow-shop with no-wait constraint problem.Although it cannot reach the optimal solution for the two-machine flow-shop with resumable unavailable interval constraint problem,the optimal gap is 0.18%on average when the number of jobs is 100.Moreover,under some special conditions,it yields the optimal solution for the two-machine flow-shop with no-wait and non-resumable unavailable interval constraints problem.Therefore,GGA is an efficient heuristic to solve these problems. 展开更多
关键词 two-machine flow-shop NO-WAIT unavailable interval Gilmore and Gomory Algorithm
原文传递
A HEURISTIC FOR F3/bi= b/C_(max) AND ITSWORST-CASE ANALYSIS
3
作者 HOU Sixiang (China Marine Development and Research Cented Box 1303-17, Beijing 100073, China) DU Donglei (Institute of Applied Mathematics, Academia Sinica, Beijing 100080, China) 《Systems Science and Mathematical Sciences》 SCIE EI CSCD 1997年第2期141-151,共11页
This paper describes a heuristic for solving F3/bi = b/Cmax scheduling problem. This algorithm first uses the Johnson’s algorithm solving F2Cmax, then, presents revised algorithm to solve F3/bi = b/Cmax. Lastly, an O... This paper describes a heuristic for solving F3/bi = b/Cmax scheduling problem. This algorithm first uses the Johnson’s algorithm solving F2Cmax, then, presents revised algorithm to solve F3/bi = b/Cmax. Lastly, an O(n log n) time heuristic is presented which generates a schedule with length at most 3/2 times that of an optimal schedule, for even number n 4, and 3/2 + 1/(2n) times that of an optimal schedule, for odd number n 4. These bounds are tight. 展开更多
关键词 two-machine FLOW SHOP three-machine FLOW SHOP worst-case analysis automated manufacturing system heuristic.
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部