상세 보기
Solution algorithms to minimise the total family tardiness for job shop scheduling with job families
- Yu, Jae-Min;
- Lee, Dong-Ho
WEB OF SCIENCE
6SCOPUS
7초록
This study addresses a job shop scheduling problem in which jobs are grouped into job families, but they are processed individually using their distinct routings. Unlike the previous studies, we consider a due-date-based objective of minimising the total family tardiness, i.e., sum of positive deviations between the due-dates and the completion times of job families. A mixed integer programming model is developed to represent the problem mathematically. Then, an optimal algorithm is proposed using the branch and bound technique while developing a job family-based lower bound. For practical applications up to large sized instances, two types of heuristics, modified shifting bottleneck and priority scheduling algorithms, are also proposed. To test the performances of the three types of solution algorithms, computational experiments were done on a number of test instances and the results are reported.
키워드
- 제목
- Solution algorithms to minimise the total family tardiness for job shop scheduling with job families
- 저자
- Yu, Jae-Min; Lee, Dong-Ho
- 발행일
- 2018-00
- 유형
- Article
- 권
- 12
- 호
- 1
- 페이지
- 1 ~ 23
- 언어
- ENG
- 출판사
- INDERSCIENCE ENTERPRISES LTD
- 발행국가
- 스위스
- 분량
- 23 페이지
- ISSN
- E 1751-5262
P 1751-5254