Zümbül Atan
Orcid: 0000-0003-1328-1756
According to our database1,
Zümbül Atan authored at least 25 papers
between 2016 and 2026.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2026
Deep reinforcement learning for optimal planning of production line maintenance with deterioration.
Reliab. Eng. Syst. Saf., 2026
Manag. Sci., 2026
2025
A robust optimization model to design an IoT-based sustainable supply chain network with flexibility.
Central Eur. J. Oper. Res., September, 2025
Multi-product Newsvendor problem with dynamic pricing: a decision interpolation approximation.
Optim. Lett., May, 2025
Optimal fulfillment and replenishment for omnichannel retailers with standard shipping contracts.
Eur. J. Oper. Res., 2025
2024
Maintenance Planning with Deterioration by a Reinforcement Learning Approach - A Semiconductor Simulation Study.
Proceedings of the Winter Simulation Conference, 2024
2023
Multi-product pricing: A discrete choice model based on Markov Chain Choice Model combined with reservation prices.
Oper. Res. Lett., November, 2023
2022
An optimal inventory policy for a multi-echelon closed-loop supply chain of postconsumer recycled content products.
Oper. Res., 2022
Dynamic Scheduling of Maintenance by a Reinforcement Learning Approach - A Semiconductor Simulation Study.
Proceedings of the Winter Simulation Conference, 2022
2021
Eur. J. Oper. Res., 2021
2020
OR Spectr., 2020
A joint economic lot-size model for sustainable industries of recycled content products.
Int. J. Prod. Res., 2020
Comput. Ind. Eng., 2020
2019
IISE Trans., 2019
Eur. J. Oper. Res., 2019
Simulation of Allocation Policies for a Serial Inventory System Under Advance Demand Information.
Proceedings of the 2019 Winter Simulation Conference, 2019
2018
OR Spectr., 2018
Optimal and heuristic policies for assemble-to-order systems with different review periods.
Eur. J. Oper. Res., 2018
2017
2016
Optim. Lett., 2016
Manuf. Serv. Oper. Manag., 2016