This study investigats a new approach-the sequential approach- in job shop scheduling. The objective is to minimize the total of lateness cost and set-up cost in job shops. Whenever a scheduling decision has to be made as to which job should receive the next processing, this approach considers each cost sequentially. One of the two costs is considered first, and every time all waiting jobs must be examined in terms of this cost, and only those jobs qualified would the second cost apply to and from which a job would be selected for processing. This investigation was carried out by using GASP IV simulation under a variety of job shop situations. The effectiveness of this approach and job selection mechanism constitute the main theme of this study.
|Number of pages||6|
|Journal||Journal of the Chinese Institute of Engineers, Transactions of the Chinese Institute of Engineers,Series A/Chung-kuo Kung Ch'eng Hsuch K'an|
|State||Published - Jan 1978|