산업경영시스템학회지 (Journal of Korean Society of Industrial and Systems Engineering)
- 제12권19호
- /
- Pages.39-47
- /
- 1989
- /
- 2005-0461(pISSN)
- /
- 2287-7975(eISSN)
n/m/D/F/Fmax 스케쥴링 문제의 휴리스틱 알고리듬 (II)
A Development of Heuristic Algorithms for the n/m/D/F/Fmax Scheduling Problem
초록
This paper considers a multi-stage flowshop scheduling Problem where the setup times of jots depend on immediately preceding jobs. Three heuristics algorithms, CAMPBELL, PEIDAN and CAMRING are proposed. The performance measure is a minimization of makespan. The parameters of simulation model are PS(ratio of the processing times to setup times), M(number of machines), and N(number of job). This simulation model for each algorithm is a 4
키워드