상세 보기
Fast and meta-heuristics for common due-date assignment and scheduling on parallel machines
- Kim, Jun-Gyu;
- Kim, Ji-Su;
- Lee, Dong-Ho
WEB OF SCIENCE
10SCOPUS
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.
키워드
- 제목
- Fast and meta-heuristics for common due-date assignment and scheduling on parallel machines
- 저자
- Kim, Jun-Gyu; Kim, Ji-Su; Lee, Dong-Ho
- 발행일
- 2012-10
- 유형
- Article
- 권
- 50
- 호
- 20
- 페이지
- 6040 ~ 6057
- 언어
- ENG
- 출판사
- TAYLOR & FRANCIS LTD
- 발행국가
- 영국
- 분량
- 18 페이지
- ISSN
- E 1366-588X
P 0020-7543