Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Najoua Dridi"'
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:
Asma Ouled bedhief, Najoua Dridi
Publikováno v:
International Journal of Industrial Engineering Computations, Vol 10, Iss 2, Pp 161-176 (2018)
In recent years, many studies on scheduling problems with dedicated machines have been carried out. But, few of them have considered the case of more than two stages. This paper aims at filling this gap by addressing the three-stage hybrid flow shop
Externí odkaz:
https://doaj.org/article/d08728e58aa94563a0f27854a6a67160
Publikováno v:
2022 International Conference on Control, Automation and Diagnosis (ICCAD).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::33291987043a4f65eee35ae6ae145d0d
https://doi.org/10.1109/iccad55197.2022.9854022
https://doi.org/10.1109/iccad55197.2022.9854022
Autor:
Asma Ouled Bedhief, Najoua Dridi
Publikováno v:
Journal Européen des Systèmes Automatisés. 53:357-368
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f3e3d87a114aa297b5d3c69945f3ffb3
https://doi.org/10.18280/jesa.530306
https://doi.org/10.18280/jesa.530306
Publikováno v:
2021 International Conference on Control, Automation and Diagnosis (ICCAD).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d868d4a5950f805265e50fb8df50e410
https://doi.org/10.1109/iccad52417.2021.9638778
https://doi.org/10.1109/iccad52417.2021.9638778
Publikováno v:
International Journal of Intelligent Systems and Applications. 8:8-21
Forecasting CPU availab ility in volunteer computing systems using a single prediction algorith m is insufficient due to the d iversity of the world -wide distributed resources. In this paper, we draw-up the main guidelines to develop an appropriate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::15bd4e18607e68bfa817c1d9031a580f
https://doi.org/10.5815/ijisa.2016.09.02
https://doi.org/10.5815/ijisa.2016.09.02
Autor:
Najoua Dridi, Sana Bouajaja
Publikováno v:
Operational Research. 17:339-369
In this paper, we present the existing literature on the human resource allocation problem. We study the main resolution approaches: exact, heuristic and metaheuristics methods proposed to solve the problem. We also examine the different studies from
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5cf47a7780f99d9d7ca7e31fe88fe232
https://doi.org/10.1007/s12351-016-0247-8
https://doi.org/10.1007/s12351-016-0247-8
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
Publikováno v:
Optimization Letters. 8:2329-2339
In this paper we introduce a branch and bound algorithm for the two-stage hybrid flow shop problem with dedicated machines. An elimination rule is used to enhance the algorithm’s performances. Experimental results show that big size instances are s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6be72c9b39b5c4a469a6cdd0fd961251
https://doi.org/10.1007/s11590-014-0741-y
https://doi.org/10.1007/s11590-014-0741-y
Publikováno v:
Journal of Mathematical Modelling and Algorithms in Operations Research. 13:233-245
In this paper, we are interested in handling the limited availability of machines in the two-stage assembly flow shop scheduling problems. Emphasis is put on the semiresumable case with respect to the minimization of the makespan. We provide, when po
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::507ef25b06ff45949c2562cf8a391d99
https://doi.org/10.1007/s10852-013-9235-7
https://doi.org/10.1007/s10852-013-9235-7