Set-up planning is an important step in manufacturing a part type, and it can be used to integrate the manufacturing functions of process planning and scheduling. While considering the problem from optimisation perspective, set-up planning involves several issues such as grouping the features, tool approach direction (TAD) and machining operations. Here, we have considered the minimisation of total manufacturing cost, makespan and maximisation of the machine utilisation to obtain an optimal set-up plan while satisfying all the constraints. The cross-machine adaptive set-up planning (ASP) for a part is a nested partition (NP)-hard problem with flexible machining resources. Also, its impact on the integration of process planning and scheduling is a crucial step. The NP-based approach, which partitions the solution space, selecting the most promising region according to the formulated objective function, is adapted and reported in this article. This approach clusters the computational effort in the most promising region and also generates an exact optimal solution for underlying various set-up planning. The proposed algorithm has been tested by taking an illustrative example, and the results are compared with genetic algorithm. Further, five diverse scenarios are studied to prove the efficiency of the proposed approach.

A nested partitioning-based approach to integrate process planning and scheduling in flexible manufacturing environment

MATTA, ANDREA;
2015-01-01

Abstract

Set-up planning is an important step in manufacturing a part type, and it can be used to integrate the manufacturing functions of process planning and scheduling. While considering the problem from optimisation perspective, set-up planning involves several issues such as grouping the features, tool approach direction (TAD) and machining operations. Here, we have considered the minimisation of total manufacturing cost, makespan and maximisation of the machine utilisation to obtain an optimal set-up plan while satisfying all the constraints. The cross-machine adaptive set-up planning (ASP) for a part is a nested partition (NP)-hard problem with flexible machining resources. Also, its impact on the integration of process planning and scheduling is a crucial step. The NP-based approach, which partitions the solution space, selecting the most promising region according to the formulated objective function, is adapted and reported in this article. This approach clusters the computational effort in the most promising region and also generates an exact optimal solution for underlying various set-up planning. The proposed algorithm has been tested by taking an illustrative example, and the results are compared with genetic algorithm. Further, five diverse scenarios are studied to prove the efficiency of the proposed approach.
merging matrix; nested partitioning; process planning; scheduling; Computer Science Applications1707 Computer Vision and Pattern Recognition; Aerospace Engineering; Electrical and Electronic Engineering; Mechanical Engineering
File in questo prodotto:
File Dimensione Formato  
A nested partitioning-based approach to integrate process planning and scheduling in flexible manufacturing environment.pdf

Accesso riservato

Descrizione: Paper definitivo
: Publisher’s version
Dimensione 941.25 kB
Formato Adobe PDF
941.25 kB Adobe PDF   Visualizza/Apri
A nested partitioning-based approach to integrate process planning and scheduling_11311-982002_Mohapatra (1).pdf

accesso aperto

: Post-Print (DRAFT o Author’s Accepted Manuscript-AAM)
Dimensione 476.02 kB
Formato Adobe PDF
476.02 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11311/982002
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 7
  • ???jsp.display-item.citation.isi??? 6
social impact