A 2-approximation algorithm for the single machine due date assignment scheduling problem in fuzzy environment to minimize the total costs

被引：1
|
作者：
Li Jinquan [1 ]
Zhang Jinhua [1 ]
机构：
[1] Beijing Normal Univ Zhuhai, Sch Appl Math, Zhuhai, Guangdong, Peoples R China
来源：
2015 11TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY (CIS) | 2015年
关键词：
rho-approximation algorithm; due date assignment; earliness/tardiness costs; precedence constraints; PROCESSING TIMES; TARDINESS COSTS; EARLINESS;
D O I：
10.1109/CIS.2015.33
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this paper, we consider the singe machine due date assignment problems with fuzzy processing time and precedence constraints. The objective is to minimize the crisp possibilistic mean value of the total earliness-tardiness penalties. The problems is NP-hard [20]. We put forward an efficient 2-approximation algorithm for this problem based on solving a linear programming relaxation of the problem. The numerical example show the algorithm given in this paper is effective.
引用
收藏
页码：104 / 108
页数：5
相关论文
共 50 条
  • [31] Single machine parallel-batching scheduling problem with fuzzy due-date and fuzzy precedence relation
    Li, Xuesong
    Ishii, Hiroaki
    Chen, Minghao
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2015, 53 (09) : 2707 - 2717
  • [32] Single machine due window assignment scheduling problem with precedence constraints and fuzzy processing times
    Li, Jinquan
    Xu, Dehua
    Li, Hongxing
    [J]. JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2018, 34 (06) : 4301 - 4314
  • [33] Approximation Schemes for Scheduling Jobs with Common Due Date on Parallel Machines to Minimize Total Tardiness
    Mikhail Y. Kovalyov
    Frank Werner
    [J]. Journal of Heuristics, 2002, 8 : 415 - 428
  • [34] Approximation schemes for scheduling jobs with common due date on parallel machines to minimize total tardiness
    Kovalyov, MY
    Werner, F
    [J]. JOURNAL OF HEURISTICS, 2002, 8 (04) : 415 - 428
  • [35] Simple heuristic to minimize total tardiness in a single machine scheduling problem
    Panneerselvam, R.
    [J]. International Journal of Advanced Manufacturing Technology, 2006, 30 (7-8): : 722 - 726
  • [36] Simple heuristic to minimize total tardiness in a single machine scheduling problem
    Panneerselvam, R.
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2006, 30 (7-8): : 722 - 726
  • [37] Simple heuristic to minimize total tardiness in a single machine scheduling problem
    R. Panneerselvam
    [J]. The International Journal of Advanced Manufacturing Technology, 2006, 30 : 722 - 726
  • [38] Due-date assignment and single machine scheduling with compressible processing times
    Cheng, TCE
    Oguz, C
    Qi, XD
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1996, 43 (01) : 29 - 35
  • [39] CON/SLK due date assignment and scheduling on a single machine with two agents
    Yin, Yunqiang
    Wang, Du-Juan
    Wu, Chin-Chia
    Cheng, T. C. E.
    [J]. NAVAL RESEARCH LOGISTICS, 2016, 63 (05) : 416 - 429
  • [40] Scheduling deteriorating jobs with CON/SLK due date assignment on a single machine
    Li, Shisheng
    Ng, C. T.
    Yuan, Jinjiang
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2011, 131 (02) : 747 - 751
12345