English

运筹学学报 >

2017 , Vol. 21 >Issue 2: 66 - 72

DOI: https://doi.org/10.15960/j.cnki.issn.1007-6093.2017.02.008

运筹学

基于退化效应的两台机器流水作业可拒绝排序

展开
  • 1. 曲阜师范大学数学科学学院, 山东 曲阜 273165
     

收稿日期: 2017-03-28

  网络出版日期: 2017-06-15

基金资助

国家自然科学基金(No.11201259), 教育部博士点基金(Nos.20123705120001, 20123705110003), 山东省自然科学基金(Nos. ZR2015GZ009, ZR2014AM012, ZR2014AM021), 曲阜师范大学科研奖励基金(No.xkj201516)

收起

Two-machine flow-shop scheduling with deterioration and rejection

Expand
  • 1. School of Mathematical Sciences, Qufu Normal University, Qufu 273165, Shandong, China

Received date: 2017-03-28

  Online published: 2017-06-15

Fold

摘要

考虑了工件具有退化效应的两台机器流水作业可拒绝排序问题, 其中工件的加工时间是其开工时间的简单线性增加函数. 每个工件或者被接收, 依次在两台流水作业机器上被加工, 或者被拒绝但需要支付一个确定的费用. 考虑的目标是被接收工件的最大完工时间加上被拒绝工件的总拒绝费用之和. 证明了问题是NP-难的, 并提出了一个动态规划算法. 最后对一种特殊情况设计了多项式时间最优算法.

关键词： 排序; 流水作业; 退化效应; 可拒绝; NP-难

本文引用格式

苗翠霞, 孟凡晓 . 基于退化效应的两台机器流水作业可拒绝排序[J]. 运筹学学报, 2017 , 21(2) : 66 -72 . DOI: 10.15960/j.cnki.issn.1007-6093.2017.02.008

Abstract

In this paper, we consider the two-machine flow-shop scheduling with deterioration and rejection, in which each job's processing time is simple linear increasing function of its starting time. A job is either accepted and processed on the two machines in a flow-shop system,  or rejected with a certain penalty having to be paid. The objective is to minimize the sum of the makespan of the accepted jobs plus the total penalty of the rejected jobs. We show that the problem is NP-hard and present a dynamic programming algorithm. Furthermore, we propose an optimal schedule for one special case.

Key words： scheduling; flow-shop; deterioration; rejection; NP-hard

参考文献

[1] Graham R L, Lawler E L, Lenstra J K, et al. Optimization and approximation in deterministic sequencing and scheduling: a survey [J]. Annals of Discrete Mathematics, 1979, 5: 287-326.
[2] Gupta G N D, Gupta S K. Single facility scheduling with nonlinear processing times [J]. Computers and Industrial Engineering, 1988, 14: 387-393.
[3] Browne S, Yechiali U. Scheduling deteriorating jobs on a single processor [J]. Operations Research, 1990, 38(3): 495-498.
[4] Mosheiov G. Scheduling jobs under simple linear deterioration [J]. Computers and Operations Research, 1994, 21: 653-659.
[5] Cheng T C E, Ding Q, Lin B M T. A concise survey of scheduling with time-dependent processing times [J]. European Journal of Operational Research, 2004, 152: 1-13.
[6] Gawiejnowicz S. Time-Dependent Scheduling [M]. Berlin: Springer, 2008.
[7] Wang J B, Wang J J. Single-machine scheduling problems with precedence constraints and simple linear deterioration [J]. Applied Mathematical Modelling, 2015, 39: 1172-1182.
[8] Bartal Y, Leonardi S, Marchetti-Spaccamela A, et al. Multiprocessor scheduling with rejection [J]. SIAM Journal Discrete Mathematics, 2000, 13: 64-78.
[9] Shabtay D, Gaspar N, Kaspi M. A survey on offline scheduling with rejection [J]. Journal of Scheduling, 2013, 16: 3-28.
[10] Choi B C, Chung J. Two-machine flow shop scheduling problem with an outsourcing option [J]. European Journal of Operational Research, 2011, 213: 66-72.
[11] Shabtay D, Gaspar N. Two-machine flow-shop scheduling with rejection [J]. Computers and Operations Research, 2012, 39: 1087-1096.
[12] Zhang L Q, Lu L F, Li S S. New results on two-machine flow-shop scheduling with rejection [J]. Journal of Combinatorial Optimization, 2016, 31: 1493-1504.
[13] Cheng Y S, Sun S T. Scheduling linear deteriorating jobs with rejection on a single machine [J]. European Journal of Operational Research, 2009,  194: 18-27.
[14] Li S S, Yuan J J. Parallel-machine scheduling with deteriorating jobs and rejection [J]. Theoretical Computer Science, 2010, 411: 3642-3650.
[15] Garey M R, Johnson D S. Computers and intractability: a guide to the theory of NP-completeness [M]. San Francisco: Freeman, 1979.
[16] Johnson S M. Optimal two-and-three-stage production schedules with set-up times included [J]. Naval Research Logistics Quarter, 1954, 1: 61-68.
Options
文章导航

/

〈 〉