Job-shop scheduling problem with fuzzy processing times

被引：0
|
作者：
Lin, FT [1 ]
机构：
[1] Chinese Culture Univ, Dept Appl Math, Taipei, Taiwan
来源：
COMPUTATIONAL SCIENCE -- ICCS 2001, PROCEEDINGS PT 2 | 2001年 / 2074卷
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Job-shop scheduling is a difficult problem, both theoretically and practically. This problem is a combinatorial optimization of considerable industrial importance. Although the job-shop scheduling problem has often been investigated, very little of this research is concerned with the uncertainty characterized by the imprecision in problem variables. In this paper, we investigate the job-shop scheduling problem with imprecise processing times. We first use triangular fuzzy numbers to represent imprecise processing times, and then construct a fuzzy job-shop scheduling model. Our work intends to extend the deterministic job-shop scheduling problem into a more generalized problem that would be useful in practical situations.
引用
收藏
页码：409 / 418
页数：10
相关论文
共 50 条
  • [1] Solving Job-Shop Scheduling Problems with Fuzzy Processing Times and Fuzzy Due Dates
    Alejandro Bustos-Tellez, Camilo
    Sebastian Tenjo-Garcia, Jhoan
    Carlos Figueroa-Garcia, Juan
    [J]. INFORMATION PROCESSING AND MANAGEMENT OF UNCERTAINTY IN KNOWLEDGE-BASED SYSTEMS: THEORY AND FOUNDATIONS, IPMU 2018, PT I, 2018, 853 : 790 - 799
  • [2] A decomposition approach to job-shop scheduling problem with discretely controllable processing times
    LAFON Pascal
    [J]. Science China Technological Sciences, 2011, (05) : 1240 - 1248
  • [3] A decomposition approach to job-shop scheduling problem with discretely controllable processing times
    GangGang Niu
    ShuDong Sun
    Pascal Lafon
    HongAn Yang
    [J]. Science China Technological Sciences, 2011, 54 : 1240 - 1248
  • [4] A decomposition approach to job-shop scheduling problem with discretely controllable processing times
    LAFON Pascal
    [J]. Science China(Technological Sciences), 2011, 54 (05) - 1248
  • [5] A decomposition approach to job-shop scheduling problem with discretely controllable processing times
    Niu GangGang
    Sun ShuDong
    Lafon, Pascal
    Yang HongAn
    [J]. SCIENCE CHINA-TECHNOLOGICAL SCIENCES, 2011, 54 (05) : 1240 - 1248
  • [6] ON THE JOB-SHOP SCHEDULING PROBLEM
    MANNE, AS
    [J]. OPERATIONS RESEARCH, 1960, 8 (02) : 219 - 223
  • [7] Two decompositions for the bicriteria job-shop scheduling problem with discretely controllable processing times
    Niu, Ganggang
    Sun, Shudong
    Lafon, Pascal
    Zhang, Yingfeng
    Wang, Junqiang
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2012, 50 (24) : 7415 - 7427
  • [8] Job-shop scheduling problem with sequence dependent setup times
    Moghaddas, R.
    Houshmand, M.
    [J]. IMECS 2008: INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS, VOLS I AND II, 2008, : 1546 - 1552
  • [9] On the solution of the job-shop scheduling problem under fuzzy environment
    Saad, Omar M.
    Sharif, Walied H.
    Abass, Samir A.
    [J]. Engineering Journal of University of Qatar, 2002, 15 : 211 - 222
  • [10] FUZZY CONSTRAINTS IN JOB-SHOP SCHEDULING
    DUBOIS, D
    FARGIER, H
    PRADE, H
    [J]. JOURNAL OF INTELLIGENT MANUFACTURING, 1995, 6 (04) : 215 - 234
12345