Modelling the machine loading problem of FMSs and its solution using a tabu-search-based heuristic

Autor:	Suman Kant, Rahul Rai, Manoj Kumar Tiwari, U. M. B. S. Sarma
Rok vydání:	2002
Předmět:	Sequence Mathematical optimization Computer science Heuristic (computer science) Mechanical Engineering Aerospace Engineering Maximization Tabu search Computer Science Applications Machine loading Minification Electrical and Electronic Engineering Throughput (business) Integer programming Algorithm
Zdroj:	International Journal of Computer Integrated Manufacturing. 15:285-295
ISSN:	1362-3052 0951-192X
DOI:	10.1080/09511920110086926
Popis:	This paper develops a modelling framework that addresses the machine loading problem of FMSs. A generic 0-1 mixed integer programming formulation that models the loading problem, with the minimization of system unbalance and maximization of throughput as the bi-criterion objective, has been proposed. The constraints considered are availability of tool slots and time on machines. Two heuristic methods are discussed to solve the problem. In heuristic 1, sequence generation is carried out using the fixed part sequencing rules. In heuristic 2, tabu-search-based methodology has been adopted to perturb the part sequences obtained from heuristic one and then reallocation of operations on machines are performed keeping in view the above objectives and constraints. The proposed methodology has been tested on ten problems representing three types of FMSs: Small, medium and large. Exhaustive computational experiments reveal that the proposed methodology consistently offers good results for all the test problems.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::572349c88c3ace4fdf7f0ced20e3fda7 https://doi.org/10.1080/09511920110086926 Zobrazit plný text záznamu Plný text ve formátu PDF