Grouping and sequencing of machining operations for high-volume transfer lines
by Soumitra Bhale; Ahmed Azab; M. Fazle Baki
International Journal of Manufacturing Technology and Management (IJMTM), Vol. 34, No. 3, 2020

Abstract: Transfer lines are employed for the mass production of fixed products or a very narrow range of product variants. This paper considers a simple transfer line balancing problem (TLBP) with a focus on process planning and line configuration. The design features of the product are grouped and machining operations are sequenced in an optimal manner. The objective is to minimise the handling time fraction of the cycle time consisting mainly of the orientation change time and the tool change time. A new mixed integer linear programming (MILP) model is proposed to solve the problem with the aforementioned objectives while respecting a set of constraints, which include cutting tool allocation, tool magazine limit, tool life limit, takt time limit and precedence, and inclusion and exclusion constraints. Problem-specific simulated annealing algorithm (SAA) and genetic algorithm (GA) are developed. Numerical experiments are conducted to illustrate the functionality of the MILP model and heuristic algorithms with respect to optimality and the computation time.

Online publication date: Wed, 13-May-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Manufacturing Technology and Management (IJMTM):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email