Zobrazeno 1 - 10
of 41
pro vyhledávání: '"Kerem Akartunali"'
Publikováno v:
European Journal of Operational Research
European Journal of Operational Research, 2022, 302 (1), pp.221-229. ⟨10.1016/j.ejor.2021.12.027⟩
European Journal of Operational Research, 2022, 302 (1), pp.221-229. ⟨10.1016/j.ejor.2021.12.027⟩
In this paper, a novel way of modeling uncertainty on demand in the single item dynamic lot sizing problem is proposed and studied. The uncertainty is not related to the demand quantity, but rather to the demand timing, i.e., the demand fully occurs
Publikováno v:
Repositório Científico de Acesso Aberto de Portugal
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP
In this paper, we consider a lot-sizing problem with the remanufacturing option under parameter uncertainties imposed on demands and returns. Remanufacturing has recently been a fast growing area of interest for many researchers due to increasing awa
The distance-based critical node problem involves identifying a subset of nodes in a network whose removal minimises a pre-defined distance-based connectivity measure. Having the classical critical node problem as a special case, the distance-based c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a41c75b5b2cc13a5f19ea57c0026619b
https://strathprints.strath.ac.uk/75982/7/Alozie_etal_JORS_2021_A_heuristic_approach_for_the_distance_based_critical_node_detection_problem_in_complex_networks.pdf
https://strathprints.strath.ac.uk/75982/7/Alozie_etal_JORS_2021_A_heuristic_approach_for_the_distance_based_critical_node_detection_problem_in_complex_networks.pdf
Publikováno v:
Optimization Letters, 16(2), 421-432. Springer-Verlag
In a single item dynamic lot-sizing problem, we are given a time horizon and demand for a single item in every time period. The problem seeks a solution that determines how much to produce and carry at each time period, so that we will incur the leas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d80f46f38a59ae9d250a9e6f0e625f75
https://strathprints.strath.ac.uk/76705/7/Arulselvan_etal_OL_2021_Economic_lot_sizing_problem_with_remanufacturing_option.pdf
https://strathprints.strath.ac.uk/76705/7/Arulselvan_etal_OL_2021_Economic_lot_sizing_problem_with_remanufacturing_option.pdf
We propose a multistage algorithm for the Vehicle Routing Problem with Time Windows and Synchronised Visits, which is capable of solving large problem instances arising in Home Health Care applications. The algorithm is based on a Constraint Programm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::95a78f1d629279aca3de270734598925
https://strathprints.strath.ac.uk/73214/1/Polnik_etal_JORS_2020_A_multistage_optimisation_algorithm_for_the_large_Vehicle_Routing_Problem.pdf
https://strathprints.strath.ac.uk/73214/1/Polnik_etal_JORS_2020_A_multistage_optimisation_algorithm_for_the_large_Vehicle_Routing_Problem.pdf
Publikováno v:
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
Universidade de São Paulo (USP)
instacron:USP
This paper addresses a lot sizing and scheduling problem inspired from a real-world production environment apparent in food industry. Due to the scarcity of resources, only a subset of production lines can operate simultaneously, and those lines need
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e1941d8f38185639e6e42f5574771c38
https://strathprints.strath.ac.uk/68691/1/Soler_etal_JORS_2019_MIP_approaches_for_a_lot_sizing_and_scheduling_problem_on_multiple_production_lines.pdf
https://strathprints.strath.ac.uk/68691/1/Soler_etal_JORS_2019_MIP_approaches_for_a_lot_sizing_and_scheduling_problem_on_multiple_production_lines.pdf
An important problem in network survivability assessment is the identification of critical nodes. The distance-based critical node detection problem addresses the issues of internal cohesiveness and actual distance connectivity overlooked by the trad
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::34ba7c7591b34aef8ca50efd01145c1b
https://strathprints.strath.ac.uk/75605/1/Alozie_etal_COR2021_Efficient_methods_for_distance_based_critical_node_detection_problem.pdf
https://strathprints.strath.ac.uk/75605/1/Alozie_etal_COR2021_Efficient_methods_for_distance_based_critical_node_detection_problem.pdf
Publikováno v:
Pesquisa Operacional, Vol 41, Iss spe (2021)
Pesquisa Operacional v.41 n.spe 2021
Pesquisa operacional
Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
instacron:SOBRAPO
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
Pesquisa Operacional, Volume: 41, Issue: spe, Article number: e240377, Published: 11 JUN 2021
Pesquisa Operacional v.41 n.spe 2021
Pesquisa operacional
Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
instacron:SOBRAPO
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
Pesquisa Operacional, Volume: 41, Issue: spe, Article number: e240377, Published: 11 JUN 2021
In this paper, we propose a novel MIP-based heuristic method to deal with a lot sizing and scheduling problem with multiple heterogeneous production lines in a production setting with perishable items. The problem is inspired by the production proces
The aim of this review article is to provide a synoptic and critical evaluation of the extensive research that has been performed in demand forecasting in the scheduled passenger transportation industry, specifically in the last few decades. The revi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9daac47c4fccff4a0f98f4d1a3dd517a
https://strathprints.strath.ac.uk/70560/1/EJOR_2019_final.pdf
https://strathprints.strath.ac.uk/70560/1/EJOR_2019_final.pdf
Autor:
Kerem Akartunali, Naomi Rutledge, Cristian Greco, Annalisa Riccardi, Alexander Kershaw, Aymen Hashim, Edmondo Minisci
Publikováno v:
Optimization Under Uncertainty with Applications to Aerospace Engineering ISBN: 9783030601652
This chapter gives a brief introduction to the formulation of optimisation problems and solving algorithms. After mentioning the different classes of problems, such as continuous/discrete, local/global and single-/multi-objective, and introducing som
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e7b70956472102e90406c94682f1d8d4
https://doi.org/10.1007/978-3-030-60166-9_7
https://doi.org/10.1007/978-3-030-60166-9_7