Minimizing total tardiness in a single machine scheduling problem with periodically scheduled maintenance정기적인 정비 계획이 있는 단일 기계 공정에서의 납기지연 최소화를 위한 연구
This research considers a single machine scheduling problem in which the machine is supposed to be stopped periodically to perform maintenance. The objective is to minimize total tardiness of all jobs which are non-resumable. To deal with the problem, a mathematical formulation is developed to find optimal solutions. In addition, two-phase heuristic algorithms which are based on Tabu Search and Simulated Annealing are derived to obtain near optimal solutions. In the heuristics, multi initialization strategy (MI) to enhance the search effectiveness is used. Computational experiments are performed to evaluate the efficiency of the formulation and the heuristics.
- Advisors
- Kim, Yeong-Daeresearcher; 김영대researcher
- Description
- 한국과학기술원 : 산업및시스템공학과,
- Publisher
- 한국과학기술원
- Issue Date
- 2009
- Identifier
- 308701/325007 / 020074038
- Language
- eng
- Description
학위논문(석사) - 한국과학기술원 : 산업및시스템공학과, 2009.2, [ ii, 41 p. ]
- Keywords
single machine scheduling problem; periodic maintenance; tardiness; heuristics; local search; 단일머신 스케쥴링 문제; 주기정비; 지연시간; 휴리스틱; 부분탐색기법; single machine scheduling problem; periodic maintenance; tardiness; heuristics; local search; 단일머신 스케쥴링 문제; 주기정비; 지연시간; 휴리스틱; 부분탐색기법
- Appears in Collection
- IE-Theses_Master(석사논문)
- Files in This Item
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.