A new optimization procedure for a re-entrant flowshop scheduling problem is proposed to plan a medium sized production schedule by mixed integer programming. Flow time is an index used to evaluate production work-in-process. The flow time is calculated from the total required cycle terms after a feasible schedule is planned. In the present paper, the reverse procedure is performed: the total cycle term is assumed before the scheduling, and the feasible schedule is planned under the assumed terms. The assumption of the total cycle term restricts the pre-assignment of every process into a corresponding cycle term. Therefore some pre-assignments never yield a feasible schedule and are eliminated from the evaluation. Methods for the assumption of the total cycle terms and for the examination of the pre-assignment of the processes are described here. The amount of times required to plan the optimal schedule is evaluated for different sizes of problems in order to validate the proposed procedures.
Skip Nav Destination
ASME/ISCIE 2012 International Symposium on Flexible Automation
June 18–20, 2012
St. Louis, Missouri, USA
Conference Sponsors:
- Dynamic Systems and Control Division
ISBN:
978-0-7918-4511-0
PROCEEDINGS PAPER
Optimization by Pre-Assignment of Processes for Re-Entrant Flowshop Scheduling Problem
Tomoya Osada
Tomoya Osada
Nagoya University, Nagoya, Japan
Search for other works by this author on:
Rei Hino
Nagoya University, Nagoya, Japan
Tomoya Osada
Nagoya University, Nagoya, Japan
Paper No:
ISFA2012-7224, pp. 333-336; 4 pages
Published Online:
July 23, 2013
Citation
Hino, R, & Osada, T. "Optimization by Pre-Assignment of Processes for Re-Entrant Flowshop Scheduling Problem." Proceedings of the ASME/ISCIE 2012 International Symposium on Flexible Automation. ASME/ISCIE 2012 International Symposium on Flexible Automation. St. Louis, Missouri, USA. June 18–20, 2012. pp. 333-336. ASME. https://doi.org/10.1115/ISFA2012-7224
Download citation file:
5
Views
Related Proceedings Papers
Related Articles
Optimal Allocation of Lift-Gas Rates Under Multiple Facility Constraints: A Mixed Integer Linear Programming Approach
J. Energy Resour. Technol (December,2006)
Optimum Selection of Discrete Tolerances
J. Mech., Trans., and Automation (June,1989)
Design Optimization of Hydraulic Networks Using Mixed Integer Linear Programming
J. Mech. Des (October,1982)
Related Chapters
Hybrid GA∕IA Method for Multiobjective Nonlinear Integer Programming Problems
Intelligent Engineering Systems through Artificial Neural Networks Volume 18
Scheduling of the Thai Premier League by Integer Programming
International Conference on Computer Research and Development, 5th (ICCRD 2013)
An Implemenation of Mixed Integer Programming Model for Gene Selection in Cancer Classification Using Microary Data
International Conference on Software Technology and Engineering (ICSTE 2012)