Some results of the worst-case analysis for flow shop scheduling with a learning effect

被引：0
作者：
Lin-Hui Sun
Kai Cui
Ju-Hong Chen
Jun Wang
Xian-Chen He
机构：
[1] Xi’an University of Science and Technology,The School of Management
[2] The State Key Laboratory for Manufacturing Systems Engineering,School of Management Engineering
[3] System Efficiency and Human Safety Ergonomics Institute of Xi’an University of Science and Technology,The School of Economics and Management
[4] Knowledge Management & Innovation Research Centre of Xi’an Jiaotong University,undefined
[5] Xi’an University of Posts & Telecommunications,undefined
[6] Xi’an University of Technology,undefined
来源：
Annals of Operations Research | 2013年 / 211卷
关键词：
Scheduling; Flow shop; Worst-case analysis; Learning effect;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
This article considers flow shop scheduling problems with a learning effect. By the learning effect, we mean that the processing time of a job is defined by a function of its position in a processing permutation. The objective is to minimize the total weighted completion time. Some heuristic algorithms by using the optimal permutations for the corresponding single machine scheduling problems are presented, and the worst-case bound of these heuristics are also analyzed.
引用
收藏
页码：481 / 490
页数：9
相关论文
共 65 条
  • [1] Badiru A. B.(1992)Computational survey of univariate and multivariate learning curve models IEEE Transactions on Engineering Management 39 176-188
  • [2] Biskup D.(2008)A state-of-the-art review on scheduling with learning effects European Journal of Operational Research 188 315-329
  • [3] Brucker P.(2004)Complexity results for flow-shop and open-shop scheduling problems with transportation delays Annals of Operations Research 129 81-106
  • [4] Knust S.(2000)A permutation flow-shop scheduling problem with convex models of operation processing times Annals of Operations Research 96 39-60
  • [5] Cheng T. C. E.(1978)Flowshop and jobshop schedules: complexity and approximation Operations Research 26 36-52
  • [6] Shakhlevich N. V.(1979)Optimization and approximation in deterministic sequencing and scheduling: a survey Annals of Discrete Mathematics 5 287-326
  • [7] Cheng T. C. E.(2004)Scheduling three-operation jobs in a two-machine flow shop to minimize makespan Annals of Operations Research 129 171-185
  • [8] Janiak A.(1999)Minimizing total completion time in a two-machine flowshop: analysis of special cases Mathematics of Operations Research 24 887-910
  • [9] Gonzalez T.(1954)Optimal two-and-three-stage production schedules Naval Research Logistics 1 61-68
  • [10] Sahni S.(2005)Algorithms with performance guarantees for flow shops with regular objective functions IIE Transactions 37 1107-1111
1234567