Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Hatem Hadda"'
Publikováno v:
Advances in Industrial and Manufacturing Engineering, Vol 9, Iss , Pp 100144- (2024)
This study investigates a complex hybrid flow shop scheduling problem prevalent in the industrial sector, characterized by dedicated machines, availability dates, and delivery times. The primary objective is to minimize the total completion time (mak
Externí odkaz:
https://doaj.org/article/d724176e8f1c4697863624e1a3cacf8b
Publikováno v:
Computation, Vol 11, Iss 7, p 137 (2023)
This paper presents a comprehensive approach for minimizing makespan in the challenging two-stage hybrid flowshop with dedicated machines, a problem known to be strongly NP-hard. This study proposed a constraint programming approach, a novel heuristi
Externí odkaz:
https://doaj.org/article/cf9c4f21ff474c508deefa849dca2e59
Autor:
Hatem Hadda, Mhamed Abdessalem
Publikováno v:
RAIRO - Operations Research. 57:325-332
In this note we introduce new characterizations for the optimal solution of the identical coupled tasks scheduling problem. We also develop three lower bounds and formulate useful observations about the choice of the test instances.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eb9b096792330e2b59ae71b757a50772
https://doi.org/10.1051/ro/2023014
https://doi.org/10.1051/ro/2023014
Publikováno v:
Computation; Volume 11; Issue 7; Pages: 137
This paper presents a comprehensive approach for minimizing makespan in the challenging two-stage hybrid flowshop with dedicated machines, a problem known to be strongly NP-hard. This study proposed a constraint programming approach, a novel heuristi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=multidiscipl::569cbd1342e4eb62a6877f56b97d7742
Publikováno v:
2021 14th International Conference on Developments in eSystems Engineering (DeSE).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::29317dd56337cf9d776b83f1a45dfc9b
https://doi.org/10.1109/dese54285.2021.9719336
https://doi.org/10.1109/dese54285.2021.9719336
Publikováno v:
Operational Research. 21:55-71
Many real-world scheduling problems are solved to obtain optimal solutions in terms of processing time, cost, and quality as optimization objectives. Parallel computing systems promise higher performance for computationally intensive applications. Si
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1d71b6d6511f715c19fcf9ca9e3e769b
https://doi.org/10.1007/s12351-018-0432-z
https://doi.org/10.1007/s12351-018-0432-z
Publikováno v:
Arabian Journal for Science and Engineering. 44:3369-3379
In this paper, the problem of scheduling on parallel machines subject to non-availability constraints with precedence constraints between the tasks is treated. We consider the minimization of the maximum completion time (i.e., makespan). We propose t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3ef3d56c528d360a0bb61c8964c1febb
https://doi.org/10.1007/s13369-018-3525-3
https://doi.org/10.1007/s13369-018-3525-3
Autor:
Hatem Hadda
Publikováno v:
OPSEARCH. 54:651-662
This paper tackles the two-machine job shop scheduling problem with limited machine availability under the resumable scenario. We provide a number of characterizations for the optimal solution. We also develop polynomial-time approximation schemes fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3fb22bef137f48f63c8375bb51c8c703
https://doi.org/10.1007/s12597-017-0298-5
https://doi.org/10.1007/s12597-017-0298-5
Publikováno v:
European J. of Industrial Engineering. 14:763
The flexible job-shop scheduling problem (FJSP) is an extension of the classical job-shop problem in which an operation may be executed by any machine out of a set of candidate machines. This paper addresses the FJSP under partial and total flexibili
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1af0cea453ab78cc332ea7d30fb6ca64
https://doi.org/10.1504/ejie.2020.112479
https://doi.org/10.1504/ejie.2020.112479
Publikováno v:
RAIRO - Operations Research. 49:795-804
In this paper we develop new elimination rules and discuss several polynomially solvable cases for the two-stage hybrid flow shop problem with dedicated machines. We also propose a worst case analysis for several heuristics. Furthermore, we point out
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b96d7cca61473c59edc058eae878ce7e
https://doi.org/10.1051/ro/2015005
https://doi.org/10.1051/ro/2015005