지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 저널정보
- 한국경영과학회 Management Science and Financial Engineering International Journal of Management Science Vol.9 No.2
- 발행연도
- 2003.11
- 수록면
- 47 - 68 (22page)
이용수
이 논문의 연구 히스토리 (4)
2004
- 이 논문의 후속연구가 궁금하신가요?
- 연관 학술논문 또는 학술발표를 통해 보다 발전된 연구결과를 확인하실 수 있습니다.
- 이 논문의 연구 히스토리 확인하기
초록· 키워드
오류제보하기
We consider the customer order sCheduling problem with job capacity restriction where the number of jobs in Ihe shop at the same time is fixed. In the cuslomer order scheduling problem, each job is part of some balch (cuslomer order) and the composition of the Jobs (productJ in the balch is prespecified. Tbe objective function is associated with the completion lime of the balches instead of the completion time of the jobs.
We first summarize the known results for the general customer order schedulin~ problems. Then, we establish some new properties for the problems with job capacity restriction. For the case of unit processing time with the objective of minimizing makespan. we develop a polynomial-time uptimal procedure [or the two machine case. For the ::)i:Ime proble:m with- a variation of on batch alternation, we also develop a polynomial-lime optimal procedure. Then, we show that the problems with the objectives of minimizing makespan and minimizing average 'batch completion time become NP-hard when there exist arbitrary number of machines. Finally, we propose optimal solution procedures for some special cases.
We first summarize the known results for the general customer order schedulin~ problems. Then, we establish some new properties for the problems with job capacity restriction. For the case of unit processing time with the objective of minimizing makespan. we develop a polynomial-time uptimal procedure [or the two machine case. For the ::)i:Ime proble:m with- a variation of on batch alternation, we also develop a polynomial-lime optimal procedure. Then, we show that the problems with the objectives of minimizing makespan and minimizing average 'batch completion time become NP-hard when there exist arbitrary number of machines. Finally, we propose optimal solution procedures for some special cases.
목차
1.INTRODUCTION
2.NOTATION
3.PRELIMINARY RESULTS
4.A POLYNOMIAL TIME PROCEDURE FOR P2│K,Pj=1│CB
5.PROBLEM P2│K,Pj=1│CB WITHNO BATCH ALTERNATION
6.COMPLEXITY OF P2│K,Pj=1│CB AND P│K,Pj=1│∑CB
7.SPECIAL CASES
8.DISCUSSION AND FURTHER RESEARCH
REFERENCES
참고문헌 (0)
참고문헌 신청함께 읽어보면 좋을 논문
논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!
-
Customer Order Scheduling Problems with Fixed Machine-Job Assignment
한국경영과학회 학술대회논문집
2004 .02
-
Customer Order Scheduling Problems with a Fixed Machine-Job Assignment
Management Science and Financial Engineering
2005 .11
-
Customer Order Scheduling in a Two Machine Flowshop
Management Science and Financial Engineering
2011 .05
-
Flow Shop Scheduling Problem with an Outsourcing Option
한국경영과학회 학술대회논문집
2010 .06
-
Customer Order Scheduling Problem on Parallel Machines with Identical Order Size
Management Science and Financial Engineering
2007 .11
-
A New Complexity Proof for Two-Stage Hybrid Flow Shop Scheduling Problem with Dedicated Machines
한국경영과학회 학술대회논문집
2008 .05
-
Parallel Machine Scheduling with Identical Jobs and Sequence-Independent Setup Times
한국경영과학회지
2014 .09
-
이종 병렬설비 공정의 작업완료시간 최소화를 위한 유전 알고리즘
경영과학
2013 .11
-
대안기계를 갖는 Job Shop Scheduling을 위한 발견적기법의 개발 ( Development of Heuristic method for Job Shop Scheduling with Alternative Machines )
한국경영과학회 학술대회논문집
1996 .01
-
다수의 경쟁이 존재하는 환경에서 적시 스케줄링에 관한 연구
한국경영과학회지
2012 .03
-
THE RELATIONSHIPS BETWEEN JOB PERFORMANCE AND JOB SATISFACTION : A REVIEW
경상논집
1981 .12
-
패밀리 셋업이 존재하는 병렬기계 일정계획 수립
한국경영과학회지
2005 .03
-
Min-Max Regret Version of an m-Machine Ordered Flow Shop with Uncertain Processing Times
Management Science and Financial Engineering
2015 .05
-
Minimizing makespan in two-stage assembly scheduling problem with dynamic component-size and setup time
한국경영과학회 학술대회논문집
2016 .04
-
Special Cases on Two Machine Flow Shop Scheduling with Weighted WIP Costs
Management Science and Financial Engineering
2009 .11
-
Multi-Class Job과 Batch Machine이 있는 Re-entrant Flow Shop의 Cycle Time분석
한국경영과학회 학술대회논문집
1999 .01
-
Minimizing the Total Stretch in Flow Shop Scheduling
Management Science and Financial Engineering
2014 .11
-
[Session B1 생산일정/수리계획]대체기계와 공정순서를 고려한 Jop Shop에서의 통합 일정계획
한국경영과학회 학술대회논문집
2003 .11
-
청소년 시간제 근로의 정규직으로 가교(ladder) 역할 탐구
직업교육연구
2002 .01
-
Off-line 처리를 위한 Batch Job 시스템 개발
한국경영과학회 학술대회논문집
2000 .01
이 논문의 저자 정보
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2009-325-013677246