Scheduling algorithms to minimise the total family flow time for job shops with job families

Citations

WEB OF SCIENCE

21
Citations

SCOPUS

24

초록

This paper considers the job scheduling problem in which jobs are grouped into job families, but they are processed individually. The decision variable is the sequence of the jobs assigned to each machine. This type of job shop scheduling can be found in various production systems, especially in remanufacturing systems with disassembly, reprocessing and reassembly shops. In other words, the reprocessing shop can be regarded as the job shop with job families since it performs the operations required to bring parts or sub-assemblies disassembled back to like-new condition before reassembling them. To minimise the deviations of the job completion times within each job family, we consider the objective of minimising the total family flow time. Here, the family flow time implies the maximum among the completion times of the jobs within a job family. To describe the problem clearly, a mixed integer programming model is suggested and then, due to the complexity of the problem, two types of heuristics are suggested. They are: (a) priority rule based heuristics; and (b) meta-heuristics. Computational experiments were performed on a number of test instances and the results show that some priority rule based heuristics are better than the existing ones. Also, the meta-heuristics improve the priority rule based heuristics significantly.

키워드

job shop scheduling; job families; total family flow time; priority rules; meta-heuristics; DRUM-BUFFER-ROPE; DISPATCHING RULES; SEQUENCING RULES; TABOO SEARCH; OPTIMIZATION; POLICIES
제목
Scheduling algorithms to minimise the total family flow time for job shops with job families
저자
Yu, Jae-Min; Kim, Ji-Su; Lee, Dong-Ho
DOI
10.1080/00207543.2010.507609
발행일
2011-11
유형
Article
저널명
International Journal of Production Research
권
49
호
22
페이지
6885 ~ 6903