Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Start > Publications > View > Job-shop scheduling-joint consideration of production, transport, and storage/retrieval systems
Publication

Publications

Job-shop scheduling-joint consideration of production, transport, and storage/retrieval systems

Title
Job-shop scheduling-joint consideration of production, transport, and storage/retrieval systems
Type
Article in International Scientific Journal
Year
2022
Authors
Homayouni, SM
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. View Authenticus page Without ORCID
Resende, MGC
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Journal
Vol. 44
Pages: 1284-1322
ISSN: 1382-6905
Publisher: Springer Nature
Other information
Authenticus ID: P-00W-ZPA
Abstract (EN): This paper proposes a new problem by integrating the job shop scheduling, the part feeding, and the automated storage and retrieval problems. These three problems are intertwined and the performance of each of these problems influences and is influenced by the performance of the other problems. We consider a manufacturing environment composed of a set of machines (production system) connected by a transport system and a storage/retrieval system. Jobs are retrieved from storage and delivered to a load/unload area (LU) by the automated storage retrieval system. Then they are transported to and between the machines where their operations are processed on by the transport system. Once all operations of a job are processed, the job is taken back to the LU and then returned to the storage cell. We propose a mixed-integer linear programming (MILP) model that can be solved to optimality for small-sized instances. We also propose a hybrid simulated annealing (HSA) algorithm to find good quality solutions for larger instances. The HSA incorporates a late acceptance hill-climbing algorithm and a multistart strategy to promote both intensification and exploration while decreasing computational requirements. To compute the optimality gap of the HSA solutions, we derive a very fast lower bounding procedure. Computational experiments are conducted on two sets of instances that we also propose. The computational results show the effectiveness of the MILP on small-sized instances as well as the effectiveness, efficiency, and robustness of the HSA on medium and large-sized instances. Furthermore, the computational experiments clearly shown that importance of optimizing the three problems simultaneous. Finally, the importance and relevance of including the storage/retrieval activities are empirically demonstrated as ignoring them leads to wrong and misleading results.
Language: English
Type (Professor's evaluation): Scientific
No. of pages: 39
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same journal

A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem (2011)
Article in International Scientific Journal
Jose Fernando Goncalves; Mauricio G C Resende
A hybrid biased random key genetic algorithm approach for the unit commitment problem (2014)
Article in International Scientific Journal
roque, lac; Dalila B.M.M. Fontes; fontes, facc
Recommend this page Top
Copyright 1996-2025 © Faculdade de Direito da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-07-07 at 17:09:09 | Privacy Policy | Personal Data Protection Policy | Whistleblowing