Cart (Loading....) | Create Account
Close category search window
 

Scheduling two-machine flow shop with a batch processing machine

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Shiegheun Koh ; Dept of Syst. Manage. & Eng., Pukyong Nat. Univ., Busan, South Korea ; Youngjin Kim ; Woonseek Lee

This paper deals with the two-machine flow shop scheduling problem in which the first machine is a batch processing machine (BPM) that can process a number of jobs simultaneously, while the second machine is a discrete processing machine (DPM) that processes jobs one by one. To minimize makespan of the system, we present a mixed integer programming formulation for the problem. Using this formulation, we show that an optimal solution for small problem can be obtained by a commercial optimization software. However, since the problem is NP-hard and the size of real problems is usually large, we propose a number of heuristic algorithms including genetic algorithm to solve practical big-sized problems in a reasonable computational time. To verify the performances of the algorithms, we compare them with lower bound for the problem. From the results we obtained, some of the heuristic algorithms show very good performances.

Published in:

Computers & Industrial Engineering, 2009. CIE 2009. International Conference on

Date of Conference:

6-9 July 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.