Fast and meta-heuristics for common due-date assignment and scheduling on parallel machines
- Title
- Fast and meta-heuristics for common due-date assignment and scheduling on parallel machines
- Author
- 이동호
- Keywords
- parallel machine scheduling; common due-date assignment; fast heuristics; meta-heuristics
- Issue Date
- 2012-10
- Publisher
- TAYLOR & FRANCIS LTD
- Citation
- INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, v. 50, NO. 20, Page. 6040-6057
- Abstract
- 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.
- URI
- https://www.tandfonline.com/doi/full/10.1080/00207543.2011.644591https://repository.hanyang.ac.kr/handle/20.500.11754/186084
- ISSN
- 0020-7543;1366-588X
- DOI
- 10.1080/00207543.2011.644591
- Appears in Collections:
- ETC[S] > ETC
- Files in This Item:
There are no files associated with this item.
- Export
- RIS (EndNote)
- XLS (Excel)
- XML