지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 저널정보
- 한국경영과학회 Management Science and Financial Engineering Management Science and Financial Engineering Vol.21 No.1
- 발행연도
- 2015.5
- 수록면
- 1 - 9 (9page)
이용수
초록· 키워드
오류제보하기
We consider an m-machine flow shop scheduling problem to minimize the latest completion time, where processing times are uncertain. Processing time uncertainty is described through a finite set of processing time vectors. The objective is to minimize maximum deviation from optimality for all scenarios. Since this problem is known to be NPhard, we consider it with an ordered property. We discuss optimality properties and develop a pseudo-polynomial time approach for the problem with a fixed number of machines and scenarios. Furthermore, we find two special structures for processing time uncertainty that keep the problem NP-hard, even for two machines and two scenarios. Finally, we investigate a special structure for uncertain processing times that makes the problem polynomially solvable.
목차
ABSTRACT
1. INTRODUCTION
2. LITERATURE REVIEW
3. EXACT ALGORITHM FOR PROBLEM OP
4. COMPUTATIONAL COMPLEXITY OF PROBLEMS OP-DIVIDE, OP-MAX ANDOP-PLUS
5. CONCLUDING REMARKS AND FUTURE WORKS
REFERENCES
참고문헌 (23)
참고문헌 신청
1. [학술지(정기간행물)] - Ahuja, R. A. / 1990 / Faster algorithm for the shortest path problem / Journal of the Association for Computing Machinery 37 : 213 ~ 223
2. [학술지(정기간행물)] - Aissi, H. / 2011 / Minimizing the number of late jobs on a single machine under due date uncertainty / Journal of Scheduling 14 : 351 ~ 360
3. [학술지(정기간행물)] - Aissi, H. / 2007 / Approximation of min-max and min-max regret versions of some combinatorial optimization problems / European Journal of Operational Research 179 : 281 ~ 290
4. [학술지(정기간행물)] - Aissi, H. / 2009 / Min-max and min-max regret versions of combinatorial optimization problems : A survey / European Journal of Operational Research 197 : 427 ~ 438
5. [학술지(정기간행물)] - Allahverdi, A. / 1996 / Two-machine proportionate flowshop scheduling with breakdown to minimize maximum lateness / Computers and Operations Research 23 : 909 ~ 916
2. [학술지(정기간행물)] - Aissi, H. / 2011 / Minimizing the number of late jobs on a single machine under due date uncertainty / Journal of Scheduling 14 : 351 ~ 360
3. [학술지(정기간행물)] - Aissi, H. / 2007 / Approximation of min-max and min-max regret versions of some combinatorial optimization problems / European Journal of Operational Research 179 : 281 ~ 290
4. [학술지(정기간행물)] - Aissi, H. / 2009 / Min-max and min-max regret versions of combinatorial optimization problems : A survey / European Journal of Operational Research 197 : 427 ~ 438
5. [학술지(정기간행물)] - Allahverdi, A. / 1996 / Two-machine proportionate flowshop scheduling with breakdown to minimize maximum lateness / Computers and Operations Research 23 : 909 ~ 916
함께 읽어보면 좋을 논문
논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!
-
Robust single-machine scheduling with uncertain processing times
한국경영과학회 학술대회논문집
2017 .04
-
기대 평균흐름시간 최소화를 위한 단일설비 일정계획의 성능변동 분석
한국경영과학회지
2016 .02
-
Predicting Machine Processing Time using Decision Tree
한국경영과학회 학술대회논문집
2017 .04
-
총 준비시간과 처리시간에 따른 학습효과를 고려한 단일설비 일정계획
한국경영과학회지
2021 .11
-
Single-Machine Scheduling with Preemption: Minimizing Weighted Late Work and Compression Costs
한국경영과학회지
2025 .02
-
A two-machine flow shop with storage under the dominant environment
한국경영과학회 학술대회논문집
2018 .04
-
A Preemptive Single-machine Scheduling Problem with Controllable Processing Times and a Late Work Criterion
한국경영과학회지
2023 .05
-
실제시간 기준의 학습 및 악화효과가 존재하는 작업들의 단일설비 일정계획
경영과학
2024 .06
-
A Single-Machine Scheduling Problem with the Controllable Processing Times and the Late Work Criterion
한국경영과학회지
2022 .05
-
선형으로 감소하는 준비시간을 갖는 작업들의 단일설비 일정계획
한국경영과학회지
2020 .11
-
Two-agent scheduling with generalized due dates
The Asian Journal of Shipping and Logistics
2018 .01
-
A permutation flow shop scheduling with convex resource consumption functions
한국경영과학회 학술대회논문집
2022 .06
-
Single-Machine Scheduling Problems with Bounded Convex Resource Consumption Functions
한국경영과학회지
2021 .05
-
Dynamic Job Shop Scheduling using Imitation Learning
한국경영과학회 학술대회논문집
2022 .06
-
Variable Neighborhood Search Algorithms for Flow Shop Scheduling with Reworks under Overlapped Queue Time Limits
한국경영과학회 학술대회논문집
2022 .06
-
Optimization Algorithms for a Two-Machine Permutation Flowshop with Limited Waiting Times Constraint and Ready Times of Jobs
Journal of Information Technology Applications & Management
2015 .06
-
시간 제약과 순서 의존 준비시간이 있는 흐름 공정에서의 총 납기지연 최소화
경영과학
2020 .09
-
Three-machine Open Shop Problem with the Minimum Makespan Criterion
한국생산관리학회지
2016 .01
-
Comparison of Tea Quality and Productive Effectiveness for Processing of Longjing Tea
한국차학회지
2015 .01
-
Application of Policy Gradient with Graph Neural Network For Job-Shop Scheduling Problem
한국경영과학회 학술대회논문집
2019 .04
이 논문의 저자 정보
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2016-325-001606010