Iterated greedy algorithms to minimize the total family flow time for job-shop scheduling with job families and sequence-dependent set-ups

Citations

WEB OF SCIENCE

21
Citations

SCOPUS

26

초록

This study addresses a variant of job-shop scheduling in which jobs are grouped into job families, but they are processed individually. The problem can be found in various industrial systems, especially in reprocessing shops of remanufacturing systems. If the reprocessing shop is a job-shop type and has the component-matching requirements, it can be regarded as a job shop with job families since the components of a product constitute a job family. In particular, sequence-dependent set-ups in which set-up time depends on the job just completed and the next job to be processed are also considered. The objective is to minimize the total family flow time, i.e. the maximum among the completion times of the jobs within a job family. A mixed-integer programming model is developed and two iterated greedy algorithms with different local search methods are proposed. Computational experiments were conducted on modified benchmark instances and the results are reported.

키워드

Job-shop scheduling with job families; sequence-dependent set-ups; total family flow time; iterated greedy algorithms; DISPATCHING RULES; GENETIC ALGORITHMS; ASSEMBLY JOBSHOPS; SEARCH ALGORITHM; BOUND METHOD; HEURISTICS; TARDINESS; MACHINE
제목
Iterated greedy algorithms to minimize the total family flow time for job-shop scheduling with job families and sequence-dependent set-ups
저자
Kim, Ji-Su; Park, Jung-Hyeon; Lee, Dong-Ho
DOI
10.1080/0305215X.2016.1261247
발행일
2017-10
유형
Article
저널명
Engineering Optimization
권
49
호
10
페이지
1719 ~ 1732