No-wait or no-idle permutation flowshop scheduling with dominating machines

被引:17
作者
Wang J.-B. [1 ]
Xia Z.-Q. [1 ]
机构
[1] Department of Applied Mathematics, Dalian University of Technology, Dalian
关键词
Dominating machines; No-idle; No-wait; Permutation flowshop; Scheduling;
D O I
10.1007/BF02936066
中图分类号
学科分类号
摘要
In this paper we study the no-wait or no-idle permutation flowshop scheduling problem with an increasing and decreasing series of dominating machines. The objective is to minimize one of the five regular performance criteria, namely, total weighted completion time, maximum lateness, maximum tardiness, number of tardy jobs and makespan. We establish that these five cases are solvable by presenting a polynomial-time solution algorithm for each case.
引用
收藏
页码:419 / 432
页数:13
相关论文
共 29 条
  • [1] Adiri I.(1982)Flowshop/on-idle or no-wait scheduling to minimize the sum of completion times Naval Research Logistics Quarterly 29 495-504
  • [2] Pohoryles D.(2002)Nonpreemptive flowshop scheduling with machine dominance European Journal of Operational Research 139 245-261
  • [3] Čepek O.(1976)The complexity of flowshop and jobshop scheduling Mathematics of Operations Research 1 117-129
  • [4] Okada M.(1979)Optimization and approximation in deterministic sequencing and scheduling: a survey Annals of Discrete Mathematics 5 287-326
  • [5] Vlach M.(1995)Flowshop scheduling with dominant machines Computers and Operations Research 22 237-246
  • [6] Garey M. R.(1954)Optimal two and three stage production schedules with setup times included Naval Research Logistics Quarterly 1 61-68
  • [7] Johnson D. S.(1977)Complexity of machine scheduling problems Annals of Discrete Mathematics 1 343-362
  • [8] Sethi R.(1983)A concise survey of effient solvable special cases of the permutation flowshop problem RAIRO 17 105-119
  • [9] Graham R. L.(1968)An n job, one machine sequencing algorithm for minimizing the number of late jobs Management Science 15 102-109
  • [10] Lawler E. L.(1992)Flow-shops with a domonant machine European Journal of Operational Research 62 38-46