A NEW TYPE OF JOB SHOP SCHEDULES WITH ROBUSTNESS TO UNCERTAIN PROCESSING TIMES
The purpose of the paper is to provide a method of generating schedules which are robust to manufacturing environment variations, while having good schedule performance in a classical job shop setting. This paper deals with processing time variations, which are one of the most popular manufacturing random factor. TET (Total Elapsed Time), a standard performance index in a classical job shop problem, is measured to evaluate as a schedule performance. A new type of schedules TET of which is both sufficiently short and robust to processing time variations is proposed. The set of the proposed type schedules consist of the subset of the non-delay type of schedules. Conclusions are as follows: a schedule of the proposed type is comparatively both efficient and robust in TET under uncertain processing times.
Job shop Type of schedules FCFS Uncertainty Processing times.
H.Matsuura S. Kurosu M.Kanesashi
Department of Industrial Engineering, Kanagawa University, 3-27-1 Rokkakubashi, Kanagawa-ku,Yokohama Post-graduate School of Commerce, Waseda University, Tokyo, Japan Department of Information Systems, Kinki University, Hiroshima, Japan
国际会议
上海
英文
1-3
2009-08-02（万方平台首次上网日期，不代表论文的发表时间）