2026 Vol.34 No.32026 Vol.34 No.22026 Vol.34 No.12026 Vol.33 No.5 Open Access2026 Vol.33 No.42026 Vol.33 No.32026 Vol.33 No.22026 Vol.33 No.12025 Vol.32 No.42025 Vol.32 No.32025 Vol.32 No.22025 Vol.32 No.12025 Vol.31 No.42025 Vol.31 No.32025 Vol.31 No.22025 Vol.31 No.12025 Vol.30 No.42025 Vol.30 No.32025 Vol.30 No.22025 Vol.30 No.1 Free Access2024 Vol.29 No.42024 Vol.29 No.32024 Vol.29 No.22024 Vol.29 No.12024 Vol.28 No.42024 Vol.28 No.32024 Vol.28 No.22024 Vol.28 No.12024 Vol.27 No.42024 Vol.27 No.32024 Vol.27 No.22024 Vol.27 No.12023 Vol.26 No.42023 Vol.26 No.32023 Vol.26 No.22023 Vol.26 No.12023 Vol.25 No.42023 Vol.25 No.32023 Vol.25 No.22023 Vol.25 No.12023 Vol.24 No.4 Open Access2023 Vol.24 No.32023 Vol.24 No.22023 Vol.24 No.12022 Vol.23 No.42022 Vol.23 No.32022 Vol.23 No.22022 Vol.23 No.12022 Vol.22 No.42022 Vol.22 No.32022 Vol.22 No.22022 Vol.22 No.12022 Vol.21 No.42022 Vol.21 No.32022 Vol.21 No.22022 Vol.21 No.12021 Vol.20 No.42021 Vol.20 No.32021 Vol.20 No.22021 Vol.20 No.12021 Vol.19 No.42021 Vol.19 No.32021 Vol.19 No.22021 Vol.19 No.12021 Vol.18 No.42021 Vol.18 No.32021 Vol.18 No.22021 Vol.18 No.12020 Vol.17 No.42020 Vol.17 No.32020 Vol.17 No.22020 Vol.17 No.12020 Vol.16 No.42020 Vol.16 No.32020 Vol.16 No.22020 Vol.16 No.12019 Vol.15 No.42019 Vol.15 No.32019 Vol.15 No.22019 Vol.15 No.12019 Vol.14 No.42019 Vol.14 No.32019 Vol.14 No.22019 Vol.14 No.12018 Vol.13 No.42018 Vol.13 No.32018 Vol.13 No.22018 Vol.13 No.12018 Vol.12 No.42018 Vol.12 No.32018 Vol.12 No.22018 Vol.12 No.12017 Vol.11 No.42017 Vol.11 No.32017 Vol.11 No.22017 Vol.11 No.12017 Vol.10 No.42017 Vol.10 No.32017 Vol.10 No.22017 Vol.10 No.12016 Vol.9 No.42016 Vol.9 No.32016 Vol.9 No.22016 Vol.9 No.12016 Vol.8 No.42016 Vol.8 No.32016 Vol.8 No.22016 Vol.8 No.12015 Vol.7 No.62015 Vol.7 No.52015 Vol.7 No.42015 Vol.7 No.32015 Vol.7 No.22015 Vol.7 No.12014 Vol.6 No.62014 Vol.6 No.52014 Vol.6 No.42014 Vol.6 No.32014 Vol.6 No.22014 Vol.6 No.12013 Vol.5 No.62013 Vol.5 No.52013 Vol.5 No.42013 Vol.5 No.32013 Vol.5 No.22013 Vol.5 No.12012 Vol.4 No.62012 Vol.4 No.52012 Vol.4 No.42012 Vol.4 No.32012 Vol.4 No.22012 Vol.4 No.12011 Vol.3 No.62011 Vol.3 No.52011 Vol.3 No.42011 Vol.3 No.32011 Vol.3 No.22011 Vol.3 No.12010 Vol.2 No.62010 Vol.2 No.52010 Vol.2 No.42010 Vol.2 No.32010 Vol.2 No.22010 Vol.2 No.12009 Vol.1 No.42009 Vol.1 No.32009 Vol.1 No.1/2

International Journal of Mathematics in Operational Research (IJMOR)

International Journal of Mathematics in Operational Research

2018 Vol.13 No.2


Pages Title and author(s)
141-177Efficient near-optimal procedures for some inventory models with backorders-lost sales mixture and controllable lead time, under continuous or periodic review
Marcello Braglia; Davide Castellano; Dongping Song
DOI: 10.1504/IJMOR.2018.094053
178-201A model for continuously degrading systems with outsourcing maintenance service
Allen H. Tai
DOI: 10.1504/IJMOR.2018.094054
202-218Proposing a new mathematical model and a meta-heuristic algorithm for scheduling and allocating automated guided vehicle
Mohammad Mehdi Tavakoli; Seyed Mojtaba Sajadi; Seyed Ali Sadeghi Aghili
DOI: 10.1504/IJMOR.2018.094055
219-242On the multiserver retrial queues with negative arrivals
Zidani Nesrine; Djellab Natalia
DOI: 10.1504/IJMOR.2018.094056
243-268An imprecise-inventory model with PEND and SEND policy
Dipak Barman; Barun Das
DOI: 10.1504/IJMOR.2018.094057
269-279Finding the shortest path by Adhwarjee's algorithm and comparison of this powerful method with Dijkstra's algorithm
Dilip Kumar Adhwarjee
DOI: 10.1504/IJMOR.2018.094058

 

Return to top