Integrated Optimal Algorithm for Flexible Job Shop Scheduling with Due-date Window

被引：0
|
作者：
Song, Juan [1 ]
机构：
[1] Ningxia Univ, Sch Phys & Elect Informat Sci, Ningxia 750021, Peoples R China
来源：
PROCEEDINGS OF THE 10TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION (WCICA 2012) | 2012年
关键词：
F[!text type='JS']JS[!/text]P; Due-date window; Genetic algorithm; Simulated annealing algorithm; E/T penality cost; GENETIC ALGORITHMS; TARDINESS; SEARCH; EARLINESS; TIME;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The objective of Flexible job shop scheduling with due-date window is to minimize the total E/T (earliness and tardiness) penalties for NP-hard problem. In this paper, an integrated optimal genetic algorithm is developed to optimize flexible scheduling objective of E/T with due-date window. In addition, mathematical model is established with respect to minimize E/T penalties, subjected to a set of practical restrained conditions. To testify optimization feasibility, the due-date window is sorted into common and discrete due-date window in the experiments. The proposed approach has been simulated on several benchmarks. Simulation results show that the hybrid algorithm proposed has satisfactory performance.
引用
收藏
页码：638 / 642
页数：5
相关论文
共 50 条
  • [31] Survey of integrated flexible job shop scheduling problems
    Li, Xixing
    Guo, Xing
    Tang, Hongtao
    Wu, Rui
    Wang, Lei
    Pang, Shibao
    Liu, Zhengchao
    Xu, Wenxiang
    Li, Xin
    COMPUTERS & INDUSTRIAL ENGINEERING, 2022, 174
  • [32] OPTIMAL ASSIGNMENT OF SLACK DUE-DATE AND SEQUENCING IN A SINGLE-MACHINE SHOP
    ALIDAEE, B
    APPLIED MATHEMATICS LETTERS, 1991, 4 (02) : 9 - 11
  • [33] Trading off due-date tightness and job tardiness in a basic scheduling model
    Baker, Kenneth R.
    Trietsch, Dan
    JOURNAL OF SCHEDULING, 2015, 18 (03) : 305 - 309
  • [34] Trading off due-date tightness and job tardiness in a basic scheduling model
    Kenneth R. Baker
    Dan Trietsch
    Journal of Scheduling, 2015, 18 : 305 - 309
  • [35] Common Due-Date Problem: Linear Algorithm for a Given Job Sequence
    Laessig, Joerg
    Awasthi, Abhishek
    Kramer, Oliver
    2014 IEEE 17th International Conference on Computational Science and Engineering (CSE), 2014, : 97 - 104
  • [36] A STUDY OF FACTORS AFFECTING DUE-DATE PREDICTABILITY IN A SIMULATED DYNAMIC JOB-SHOP
    CHANG, FCR
    JOURNAL OF MANUFACTURING SYSTEMS, 1994, 13 (06) : 393 - 400
  • [37] EXPERIMENTAL INVESTIGATION OF AN FMS DUE-DATE SCHEDULING PROBLEM - AN EVALUATION OF DUE-DATE ASSIGNMENT RULES
    SABUNCUOGLU, I
    HOMMERTZHEIM, DL
    INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING, 1995, 8 (02) : 133 - 144
  • [38] NEIGHBORHOOD ALGORITHM FOR FLEXIBLE JOB SHOP SCHEDULING PROBLEMS
    Ishigaki, Aya
    Matsui, Yuki
    ICIM'2016: PROCEEDINGS OF THE 13TH INTERNATIONAL CONFERENCE ON INDUSTRIAL MANAGEMENT, 2016, : 3 - 8
  • [39] Genetic algorithm for flexible job-shop scheduling
    Univ of Magdeburg, Magdeburg, Germany
    Proc IEEE Int Conf Rob Autom, (1120-1125):
  • [40] A genetic algorithm for flexible job-shop scheduling
    Chen, HX
    Ihlow, J
    Lehmann, C
    ICRA '99: IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1-4, PROCEEDINGS, 1999, : 1120 - 1125
12345