An iterative refining mechanism for general job shop scheduling problems

Tsung Che Chiang*, Li Chen Fu

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

This paper addresses the general job shop scheduling problem with the objective as how to increase the meet-due-date rate. An iterative schedule refining mechanism is proposed, which iteratively adjusts the estimation of the remaining processing times of jobs in a dynamic and stage-specific manner. The refining mechanism is applied to a recently proposed sequencing heuristic and the integrated approach shows satisfactory performance through a comprehensive simulation study. Besides, we also show that the proposed refining mechanism can bring much improvement to several conventional rules.

Original languageEnglish
Title of host publicationProceedings of the 2005 IEEE Conference on Automation Science and Engineering, IEEE-CASE 2005
Pages203-208
Number of pages6
DOIs
Publication statusPublished - 2005
Externally publishedYes
Event2005 IEEE Conference on Automation Science and Engineering, IEEE-CASE 2005 - Edmonton, Canada
Duration: 2005 Aug 12005 Aug 2

Publication series

NameProceedings of the 2005 IEEE Conference on Automation Science and Engineering, IEEE-CASE 2005
Volume2005

Other

Other2005 IEEE Conference on Automation Science and Engineering, IEEE-CASE 2005
Country/TerritoryCanada
CityEdmonton
Period2005/08/012005/08/02

Keywords

  • Heuristics
  • Job shops
  • Scheduling

ASJC Scopus subject areas

  • General Engineering

Fingerprint

Dive into the research topics of 'An iterative refining mechanism for general job shop scheduling problems'. Together they form a unique fingerprint.

Cite this