지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 저널정보
- 한국경영과학회 Management Science and Financial Engineering International Journal of Management Science Vol.13 No.2
- 발행연도
- 2007.11
- 수록면
- 47 - 77 (31page)
이용수
초록· 키워드
오류제보하기
This paper considers a scheduling problem where a customer orders multiple products (jobs) from a production facility. The objective is to minimize the sum of the order (batch) completion times. While a machine can process only one job at a time, multiple machines can simultaneously process jobs in a batch. Although each job has a unique processing time, we consider the case where batch processing times are identical. This simplification allows us to develop heuristics with improved performance bounds. This problem was motivated by a real world problem encountered by foreign electronics manufacturers.
We first establish the complexity of the problem. For the two parallel machine case, we introduce two simple but intuitive heuristics, and find their worst case relative error bounds. One bound is tight and the other bound goes to 1 as the number of orders goes to infinity. However, neither heuristic is superior for all instances. We extend one of the heuristics to an arbitrary number of parallel machines. For a fixed number of parallel machines, we find a worst case bound which goes to 1 as the number of orders goes to infinity. Then, a tighter bound is found for the three parallel machine case. Finally, the heuristics are empirically evaluated.
We first establish the complexity of the problem. For the two parallel machine case, we introduce two simple but intuitive heuristics, and find their worst case relative error bounds. One bound is tight and the other bound goes to 1 as the number of orders goes to infinity. However, neither heuristic is superior for all instances. We extend one of the heuristics to an arbitrary number of parallel machines. For a fixed number of parallel machines, we find a worst case bound which goes to 1 as the number of orders goes to infinity. Then, a tighter bound is found for the three parallel machine case. Finally, the heuristics are empirically evaluated.
목차
ABSTRACT
1. Introduction
2. Notation
3. Complexity and Basic Results
4. Two Parallel Machines
5. More Than Two Parallel Machines
6. Computational Study
7. Discussion and Further Research
References
참고문헌 (17)
참고문헌 신청
1. [학술지(정기간행물)] - Ahmadi, R / 2005 / Coordinated Scheduling of Cus-tomer Orders for Quick Response 52 : 493 ~ 512
2. [학술지(정기간행물)] - Baker / 1988 / “Scheduling the Production of Components at a Common Facil-ity : 32 ~ 35
3. [학술지(정기간행물)] - Blocher, J. D / 1996 / The Customer Order Lead Time Problem on Parallel Machines 43 : 629 ~ 654
4. [학술지(정기간행물)] - Blocher, J. D / 1998 / Customer Order Scheduling in a General Job Shop Environment 29 : 951 ~ 981
5. [학술지(정기간행물)] - Bruno / 1974 / “Scheduling Independent Tasks to Re-duce Mean Finishing Time ” Communications of the ACM 17 : 382 ~ 387
2. [학술지(정기간행물)] - Baker / 1988 / “Scheduling the Production of Components at a Common Facil-ity : 32 ~ 35
3. [학술지(정기간행물)] - Blocher, J. D / 1996 / The Customer Order Lead Time Problem on Parallel Machines 43 : 629 ~ 654
4. [학술지(정기간행물)] - Blocher, J. D / 1998 / Customer Order Scheduling in a General Job Shop Environment 29 : 951 ~ 981
5. [학술지(정기간행물)] - Bruno / 1974 / “Scheduling Independent Tasks to Re-duce Mean Finishing Time ” Communications of the ACM 17 : 382 ~ 387
함께 읽어보면 좋을 논문
논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!
-
Customer Order Scheduling Problems with a Fixed Machine-Job Assignment
Management Science and Financial Engineering
2005 .11
-
Customer Order Scheduling Problems with Fixed Machine-Job Assignment
한국경영과학회 학술대회논문집
2004 .02
-
두 개의 장비그룹을 고려한 병렬기계의 일정계획 ( A Heuristic for Parallel Machine Scheduling System with Two Machine Groups )
한국경영과학회 학술대회논문집
1999 .01
-
Special Cases on Two Machine Flow Shop Scheduling with Weighted WIP Costs
Management Science and Financial Engineering
2009 .11
-
Scheduling of Three-Operation Jobs in a Two-Machine Flow Shop with mean flow time measure
한국경영과학회 학술대회논문집
2006 .11
-
Customer Order Scheduling in a Two Machine Flowshop
Management Science and Financial Engineering
2011 .05
-
재투입이 존재하는 2단계 순열흐름공정에서 총 작업 흐름시간을 최소화하는 분지한게방법
한국경영과학회 학술대회논문집
2010 .06
-
작업의 특성에 종속되는 병렬기계의 일정계획을 위한 발견적 기법 ( A Heuristic for Parallel Machine Scheduling Depending on Job Characteristics )
경영과학
2000 .05
-
Heuristics for non-identical parallel machine scheduling with sequence and machine dependent setup and processing times
한국경영과학회 학술대회논문집
2013 .05
-
이종 병렬설비 공정의 작업완료시간 최소화를 위한 유전 알고리즘
경영과학
2013 .11
-
Parallel Machine Scheduling with Identical Jobs and Sequence-Independent Setup Times
한국경영과학회지
2014 .09
-
Two-stage Meta-Heuristic Algorithm for Parallel Machine Scheduling with Additional Resource Input in Shipyard Manufacturing
한국경영과학회 학술대회논문집
2019 .04
-
휴리스틱 유형과 영향요인, 행동의도와의 관계 연구 : 와인제품 구매행동 중심으로
인터넷전자상거래연구
2016 .02
-
대안기계를 갖는 Job Shop Scheduling을 위한 발견적기법의 개발 ( Development of Heuristic method for Job Shop Scheduling with Alternative Machines )
한국경영과학회 학술대회논문집
1996 .01
-
패밀리 셋업이 존재하는 병렬기계 일정계획 수립
한국경영과학회지
2005 .03
-
대기 상태를 고려한 배치 단위 생산 공정에서 생산계획 수립을 위한 정수계획법 모형 및 휴리스틱 알고리즘 개발
한국경영과학회 학술대회논문집
2006 .11
-
병렬기계에서 공통납기 결정 및 일정계획 문제에 관한 탐색 알고리듬
한국경영과학회 학술대회논문집
2009 .05
-
A Heuristic for Single Machine Scheduling with Unequal Due Dates and Release Times
한국경영과학회 학술대회논문집
1998 .01
-
총 납기지연시간 최소화를 위한 두 단계 조립시스템에서 일정계획에 관한 연구
한국경영과학회지
2008 .09
이 논문의 저자 정보
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2009-325-016133583