지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 발행연도
- 2018.3
- 수록면
- 85 - 92 (8page)
이용수
이 논문의 연구 히스토리 (7)
2018
A time-cost tradeoff problem with multiple milestones on the precedence graph with m chains in parallel
Byung-Cheon Choi
,
Jibok Chung
한국경영과학회 학술대회논문집
2018.04
학술대회자료
A time-cost tradeoff problem with multiple milestones on the precedence graph with m chains in parallel
Byung-Cheon Choi
,
Jibok Chung
대한산업공학회 춘계공동학술대회 논문집
2018.04
학술대회자료
A time-cost tradeoff problem with multiple interim assessments under the precedence graph with two chains in parallel
Byung-Cheon Choi
,
Yunhong Min
한국컴퓨터정보학회논문지
2018.03
학술저널
2017
A time-cost tradeoff problem with multiple milestones on the precedence graph with two chain
Byung-Cheon Choi
,
Jibok Chung
한국경영과학회 학술대회논문집
2017.04
학술대회자료
A time-cost tradeoff problem with multiple milestones on the precedence graph with two chain
Byung-Cheon Choi
,
Jibok Chung
대한산업공학회 춘계공동학술대회 논문집
2017.04
학술대회자료
2015
The continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs
Byung-Cheon Choi
,
Jibok Chung
,
Myoung-Ju Pa
외 1명
한국경영과학회 학술대회논문집
2015.04
학술대회자료
The continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs
Byung-Cheon Choi
,
Jibok Chung
,
Myoung-Ju Pa
외 1명
대한산업공학회 춘계공동학술대회 논문집
2015.04
학술대회자료
- 이 논문의 후속연구가 궁금하신가요?
- 연관 학술논문 또는 학술발표를 통해 보다 발전된 연구결과를 확인하실 수 있습니다.
- 이 논문의 연구 히스토리 확인하기
초록· 키워드
오류제보하기
We consider a project scheduling problem in which the jobs can be compressed by using additional resource to meet the corresponding due dates, referred to as a time-cost tradeoff problem. The project consists of two independent subprojects of which precedence graph is a chain. The due dates of jobs constituting the project can be interpreted as the multiple assessments in the life of project. The penalty cost occurs from the tardiness of the job, while it may be avoided through the compression of some jobs which requires an additional cost. The objective is to find the amount of compression that minimizes the total tardy penalty and compression costs. Firstly, we show that the problem can be decomposed into several subproblems whose number is bounded by the polynomial function in n, where n is the total number of jobs. Then, we prove that the problem can be solved in polynomial time by developing the efficient approach to obtain an optimal schedule for each subproblem.
목차
Abstract
I. Introduction
II. Decomposition of Problem P
III. Polynomiality of Subproblems
IV. Conclusions
REFERENCES
참고문헌 (16)
참고문헌 신청
C. Artigues / 2008 / Resource- Constrained Project Scheduling / Wiley
E.B. Berman / 1964 / Resource allocation in a PERT network under continuous activity time-cost function / Management Science 10:734~745
J. Bell / 2000 / Beauty is in the eye of the beholder: Establishing a fair and equitable value for embryonic high-tech enterprises / Venture Capital Journal 40:33~34
Peter Brucker / 1999 / Resource-constrained project scheduling: Notation, classification, models, and methods / European Journal of Operational Research 112(1):3~41
Byung-Cheon Choi / 2014 / Complexity results for the linear time–cost tradeoff problem with multiple milestones and completely ordered jobs / European Journal of Operational Research 236(1):61~68
E.B. Berman / 1964 / Resource allocation in a PERT network under continuous activity time-cost function / Management Science 10:734~745
J. Bell / 2000 / Beauty is in the eye of the beholder: Establishing a fair and equitable value for embryonic high-tech enterprises / Venture Capital Journal 40:33~34
Peter Brucker / 1999 / Resource-constrained project scheduling: Notation, classification, models, and methods / European Journal of Operational Research 112(1):3~41
Byung-Cheon Choi / 2014 / Complexity results for the linear time–cost tradeoff problem with multiple milestones and completely ordered jobs / European Journal of Operational Research 236(1):61~68
함께 읽어보면 좋을 논문
논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!
-
A time-cost tradeoff problem with multiple milestones on the precedence graph with m chains in parallel
대한산업공학회 춘계공동학술대회 논문집
2018 .04
-
A time-cost tradeoff problem with multiple milestones on the precedence graph with two chain
대한산업공학회 춘계공동학술대회 논문집
2017 .04
-
The continuous time-cost tradeoff problem with multiple milestones and completely ordered jobs
대한산업공학회 춘계공동학술대회 논문집
2015 .04
-
A Just-in-time Scheduling Problem with Generalized Due Dates and Controllable Processing Times
한국 SCM 학회지
2020 .05
-
지연 스케쥴을 허용하는 납기최소화 잡샵 스케쥴링 알고리즘
산업경영시스템학회지
2019 .01
-
Multi Project Scheduling and Material Planning Using Lagrangian Relaxation Algorithm
Industrial Engineering & Management Systems
2021 .12
-
Project scheduling with multiple agents
대한산업공학회 춘계공동학술대회 논문집
2017 .04
-
시간-비용 최적관계 분석용 정확해 추정기법
대한건축학회 논문집 - 구조계
2015 .02
-
A Just-in-time Single-machine Scheduling Problem with Convex Resource Consumption Functions, Generalized Due Dates and Rejection
한국 SCM 학회지
2023 .05
-
Parallel-Machine Scheduling to Minimize Tardiness Penalty and Energy Cost by using Evolutionary Algorithms
Industrial Engineering & Management Systems
2021 .12
-
Development of a Descriptive Cost Effectiveness Model for a Subcontractor with Limited Resources
한국BIM학회논문집
2017 .01
-
요약 그래프 상에서 효과적인 그래프 압축 기법
한국정보과학회 학술발표논문집
2016 .06
-
A New Stochastic Time-Cost-Quality Trade-Off Project Scheduling Problem Considering Multiple-Execution Modes, Preemption, and Generalized Precedence Relations
Industrial Engineering & Management Systems
2017 .09
-
Application of Policy Gradient with Graph Neural Network For Job-Shop Scheduling Problem
대한산업공학회 춘계공동학술대회 논문집
2019 .04
-
방위력개선사업 비용분석 신뢰성 향상방안 연구 - 국내 연구개발을 중심으로
한국산학기술학회 논문지
2022 .11
-
Cost modelling of heritage buildings in Malaysia. Issues and challenges
한국생태환경건축학회 학술발표대회 논문집
2021 .11
-
베이지안넷 기반의 프로젝트 일정리스크 평가
산업경영시스템학회지
2016 .01
-
Quantity Surveyors' Perception of Cost Impact Factors in Hong Kong Civil Engineering Projects
Journal of construction engineering and project management
2015 .01
-
A Study on Life Cycle Cost on Railway Locomotive Systems
International Journal of Railway
2016 .09
-
자원 제약이 있는 프로젝트 스케줄링 문제를 위한 그래프 신경망 기반의 강화학습 알고리즘
대한산업공학회 춘계공동학술대회 논문집
2022 .06
이 논문의 저자 정보
이 논문과 함께 이용한 논문
최근 본 자료
댓글(0)
0