• DocumentCode
    2096492
  • Title

    Using dispatching rules for job shop scheduling with due date-based objectives

  • Author

    Chiang, Tsung-Che ; Fu, Li-Chen

  • Author_Institution
    Dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Univ., Taipei
  • fYear
    2006
  • fDate
    15-19 May 2006
  • Firstpage
    1426
  • Lastpage
    1431
  • Abstract
    This paper addresses the job shop scheduling problem with the due date-based objectives including the tardy rate, mean tardiness, and the maximum tardiness. The focused approach is dispatching rules. Sixteen dispatching rules are selected from the literature and used as the benchmarks. Their features and design concepts are also discussed. Then a dispatching rule is proposed with the goal as achieving good and balanced performance when more than one objective is concerned at the same time. The experimental results verified its superiority, especially on the tardy rate and mean tardiness
  • Keywords
    dispatching; job shop scheduling; dispatching rules; due date-based objectives; job shop scheduling; Computer industry; Computer science; Dispatching; Equations; Genetic algorithms; Job shop scheduling; Mathematical programming; Processor scheduling; Robotics and automation; Scheduling algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Robotics and Automation, 2006. ICRA 2006. Proceedings 2006 IEEE International Conference on
  • Conference_Location
    Orlando, FL
  • ISSN
    1050-4729
  • Print_ISBN
    0-7803-9505-0
  • Type

    conf

  • DOI
    10.1109/ROBOT.2006.1641909
  • Filename
    1641909