Fast and meta-heuristics for common due-date assignment and scheduling on parallel machines

Citations

WEB OF SCIENCE

10
Citations

SCOPUS

12

초록

This study considers common due-date assignment and scheduling on parallel machines. The problem has three decision variables: assigning the common-due-date, allocating jobs to parallel machines, and sequencing the jobs assigned to each machine. The objective is to minimise the sum of due-date assignment, earliness and tardiness penalties. A mathematical programming model is presented, and then two types of heuristics are suggested after characterising the optimal solution properties. The two types of heuristics are: (a) a fast two-stage heuristic with obtaining an initial solution and improvement; and (b) two meta-heuristics, tabu search and simulated annealing, with new neighbourhood generation methods. Computational experiments were conducted on a number of test instances, and the results show that each of the heuristic types outperforms the existing one. In particular, the meta-heuristics suggested in this study are significantly better than the existing genetic algorithm.

키워드

parallel machine scheduling; common due-date assignment; fast heuristics; meta-heuristics; SINGLE-MACHINE; TARDINESS PENALTIES; ALGORITHMS; EARLINESS; SEQUENCE
제목
Fast and meta-heuristics for common due-date assignment and scheduling on parallel machines
저자
Kim, Jun-Gyu; Kim, Ji-Su; Lee, Dong-Ho
DOI
10.1080/00207543.2011.644591
발행일
2012-10
유형
Article
저널명
International Journal of Production Research
권
50
호
20
페이지
6040 ~ 6057