http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
긴급주문과 순서의존준비시간이 있는 흐름공정의 일정계획 휴리스틱 알고리즘 연구
이주용(Ju-Yong Lee),정봉주(BongJoo Jeong) 한국경영과학회 2020 經營 科學 Vol.37 No.1
This paper considers a two-machine flowshop scheduling problem in which there are sequence-dependent setup times and two classes of jobs with different urgencies, i.e., urgent jobs and normal (not urgent) jobs. The objective of this problem is minimizing total tardiness of one class for urgent jobs and the maximum completion time (makespan) of the other class for normal (non-urgent) jobs. To solve this problem, we propose a mathematical formulation and several heuristic algorithms (three list scheduling algorithms, two constructive algorithms, one meta-heuristic algorithm). To evaluate the performance of the developed algorithms, computational experiments are performed on randomly generated instances. The results show that the proposed algorithms can provide reasonable solutions in a short time for given instances.