Abstract
A new theoretical formulation for re-entrant flow shop scheduling problem is derived to plan an optimum production schedule by mixed integer programming. Flow time, which is an index of the evaluation of the planned schedule, is minimized to decrease amount of work-in-process. Cycle time, which is another important index, is determined by the total load time on a bottleneck machine to manufacture the products at the highest productivity. Both objective function and constraint conditions are described in linear expressions and a general optimization tool is adopted to solve the formulated scheduling problems. Another objective function is also introduced in order to shorten the time for the optimization. Computational scheduling results obtained by the optimization are evaluated and discussed in the present paper.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of the Japan Society for Precision Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
