Quasi Assignment Algorithms in Job Shops

  • Byeon Eui-Seok (Department of Industrial Engineering, SunMoon University) ;
  • Lee Jang-Yong (Department of Industrial Engineering, SunMoon University)
  • Published : 2002.05.01

Abstract

Production scheduling has been one of the most critical issues in a manufacturing environment Job-shop scheduling problems(JSP) are well know from the standpoint of production planning and operations control in this research scheduling against due date is a measure of performance and the objective is minimizing total weighted tardiness This paper presents an idea of decomposition of the problem and shows robustmess of the schedule under various disturbances along with exact and approximation methods. The proposed method can indeed handle shop disturbances more effectively when compared with traditional and dynamic scheduling methods.

Keywords