지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
이용수
초록· 키워드
오류제보하기
This paper considers a two-stage hybrid flow shop scheduling problem for the objective of minimizing the number of tardy jobs. Each job is processed through the two production stages in series, each of which has multiple identical parallel machines. The problem is to determine the allocation and sequence of jobs at each stage. A branch and bound algorithm that gives the optimal solutions is suggested that incorporates the methods to obtain the lower and upper bounds. Dominance properties are also suggested to reduce the search space. To show the performance of the algorithm, computational experiments are done on randomly generated problems, and the results are reported.
목차
1. Introduction
2. Problem Description
3. Branch and Bound Algorithm
4. Computational Experiments
5. Concluding Remarks
References
참고문헌 (20)
참고문헌 신청
1. [학술지(정기간행물)] - Azizoglu / 2001 / A flexible flow shop problem with total flow time minimization 132 : 528 ~ 538
2. [학술지(정기간행물)] - Azizoglu / 1998 / Tardiness minimization on parallel machines 55 : 163 ~ 168
3. [학술지(정기간행물)] - Brah / 1991 / Branch and bound algorithm for the flow shop with multiple processors European Journal of Operational Research : 88 ~ 99
4. [학술지(정기간행물)] - Chen / 1995 / Analysis of classes of heuristics for scheduling a two-stage flow shop with parallel machines at on stage 46 : 231 ~ 244
5. [학술지(정기간행물)] - Fouad / 1998 / A hybrid three-stage flowshop problem Efficient heuristics to minimize makespan 109 : 321 ~ 329
2. [학술지(정기간행물)] - Azizoglu / 1998 / Tardiness minimization on parallel machines 55 : 163 ~ 168
3. [학술지(정기간행물)] - Brah / 1991 / Branch and bound algorithm for the flow shop with multiple processors European Journal of Operational Research : 88 ~ 99
4. [학술지(정기간행물)] - Chen / 1995 / Analysis of classes of heuristics for scheduling a two-stage flow shop with parallel machines at on stage 46 : 231 ~ 244
5. [학술지(정기간행물)] - Fouad / 1998 / A hybrid three-stage flowshop problem Efficient heuristics to minimize makespan 109 : 321 ~ 329
함께 읽어보면 좋을 논문
논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!
-
2 단계 혼합흐름공정에서의 일정계획문제에 관한 연구
대한산업공학회 춘계공동학술대회 논문집
2006 .05
-
Surrogate Objective based Search Heuristics to Minimize the Number of Tardy Jobs for Multi-Stage Hybrid Flow Shop Scheduling
대한산업공학회지
2009 .12
-
Surrogate objective based search heuristics for multi-stage hybrid flow shop scheduling
대한산업공학회 춘계공동학술대회 논문집
2008 .05
-
A New Complexity Proof for Two-Stage Hybrid Flow Shop Scheduling Problem with Dedicated Machines
대한산업공학회 춘계공동학술대회 논문집
2008 .05
-
재투입이 존재하는 2단계 순열흐름공정에서 총 작업 흐름시간을 최소화하는 분지한게방법
대한산업공학회 춘계공동학술대회 논문집
2010 .06
-
Branch and Bound Approach for Single-Machine Sequencing with Early/Tardy Penalties and Sequence-Dependent Setup Cost
Industrial Engineering & Management Systems
2004 .12
-
An Improved Branch-and-Bound Algorithm for Scheduling Jobs on Identical Machines
대한산업공학회지
1975 .12
-
작업 군이 존재하는 개별공정 일정계획 문제에 대한 시뮬레이티드 어닐링 알고리듬
대한산업공학회 추계학술대회 논문집
2008 .11
-
재투입이 존재하는 2단계 흐름공정에서 총 작업 흐름시간을 최소화하는 분지한계방법
산업경영시스템학회지
2010 .01
-
Hybrid Flow Shop with Parallel Machines at the First Stage and Dedicated Machines at the Second Stage
Industrial Engineering & Management Systems
2015 .03
-
Scheduling algorithms for two-stage assembly job-shop-type remanufacturing systems with job families
대한산업공학회 춘계공동학술대회 논문집
2016 .04
-
Job Shop Scheduling에서 발견적 할당 규칙을 이용한 Branch Method
대한산업공학회 추계학술대회 논문집
1996 .10
-
Study on Scheduling Algorithm for Hybrid shop floor control system
한국정밀공학회 학술발표대회 논문집
2000 .05
-
작업 스케쥴링 문제 해결을 위한 Branch & Bound 해법의 비교분석
대한산업공학회지
1992 .12
-
다양성유지를 기반으로 한 Job-shop Scheduling Problem의 진화적 해법
한국지능시스템학회 논문지
2001 .06
-
1단계에 전용 기계가 있는 2단계 하이브리드 Flow Shop
대한산업공학회 춘계공동학술대회 논문집
2013 .05
-
Differential Evolution Algorithm for Job Shop Scheduling Problem
Industrial Engineering & Management Systems
2011 .09
-
A Heuristic Method for Solving Bi-Objective Two-Stage Hybrid Flow Shop Scheduling Problem
Industrial Engineering & Management Systems
2017 .06
-
A Branch-and-Bound Algorithm to Minimize the Makespan in a Fire Scheduling Problem
산업경영시스템학회지
2015 .01
-
A Flexible Branch and Bound Method for the Job Shop Scheduling Problem
Industrial Engineering & Management Systems
2009 .12
이 논문의 저자 정보
이 논문과 함께 이용한 논문
1단계에 전용 기계가 있는 2단계 하이브리드 Flow Shop
양재환
한국경영과학회 학술대회논문집
2013
.05
성육신의 교훈
김용규
기독교사상
2012
.06
[말씀이 육신이 된다함은] 나의 것 나누는 것이 ‘성육신’의 삶
김영헌
,
이경화
새가정
1994
.12
성탄의 세 가지 의미
이대용
기독교사상
1996
.12
Hybrid Flow Shop with Parallel Machines at the First Stage and Dedicated Machines at the Second Stage
Jaehwan Yang
Industrial Engineering & Management Systems
2015
.03
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2013-530-003585088