Zobrazeno 1 - 10
of 11
pro vyhledávání: '"T. T. Narendran"'
Publikováno v:
The Journal of Defense Modeling and Simulation: Applications, Methodology, Technology. 6:151-164
The problem of routing and scheduling military convoys adhering to certain constraints is known as the convoy movement problem. This work addresses a bi-criteria model for the peacetime version of the convoy movement problem with minimizing total tra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bf49f494e1e935a68ac7740780addc69
https://doi.org/10.1177/1548512909348233
https://doi.org/10.1177/1548512909348233
Autor:
P.N. Ram Kumar, T. T. Narendran
Publikováno v:
Strategic Analysis. 33:590-606
Convoy movement problem involves routing and scheduling military convoys across a limited route network, adhering to certain strategic constraints. This article suggests using heuristics for solving the dynamic version of the problem where the networ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cb7b47eb47d8f21b7e080cd8c81d5a98
https://doi.org/10.1080/09700160902907126
https://doi.org/10.1080/09700160902907126
Autor:
K. Rajkumar, T. T. Narendran
Publikováno v:
Production Planning & Control. 9:465-476
The problem of sequencing PCB assembly is addressed in this study with the objective of minimizing setup times. Using the basic Group Technology philosophy of exploiting similarities, a heuristic is developed. When tested over a variety of problems,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::442edd93eb14496b2fe130c65294ac90
https://doi.org/10.1080/095372898233948
https://doi.org/10.1080/095372898233948
Autor:
T. T. Narendran, K. Rajkumar
Publikováno v:
Production Planning & Control. 8:743-752
The problem of loading PCBs on automated assembling machines with the twin objectives of minimizing the makespan and balancing the load is addressed in this study. Noting that setup times are route-dependent and insertion times are relatively negligi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3d8a0ce0f3f6080b15bfcd9889c81887
https://doi.org/10.1080/095372897234632
https://doi.org/10.1080/095372897234632
Autor:
P.N. Ram Kumar, T. T. Narendran
Publikováno v:
IndraStra Global.
The problem of routing military convoys between specific origin and destination pairs is known as convoy movement problem (CMP). In this study, we consider an existing mathematical model of CMP and propose a lower bounding procedure based on Lagrange
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::33882e17c5e0a2f34c88a2aa6e461868
http://hdl.handle.net/11717/12769
http://hdl.handle.net/11717/12769
Publikováno v:
Production Planning & Control. 4:153-158
The problem of finding the best permutation schedule for a flowshop has engaged the attention of researchers for almost four decades. In view of its NP-completeness, the problem is not amenable to the development of efficient optimizing algorithms. A
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::386e83bc035408957d30b072109375f7
https://doi.org/10.1080/09537289308919432
https://doi.org/10.1080/09537289308919432
Autor:
P.N. Ram Kumar, T. T. Narendran
Publikováno v:
Innovations in Defence Support Systems – 1 ISBN: 9783642140839
This chapter addresses the convoy movement problem (CMP) in military logistics. CMP involves routing and scheduling military convoys within the strategic constraints. The chapter begins with an introduction to the domain of military logistics. It is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::991b29504d3021c81d97cb42aaac6902
https://doi.org/10.1007/978-3-642-14084-6_4
https://doi.org/10.1007/978-3-642-14084-6_4
Autor:
P.N. Ram Kumar, T. T. Narendran
Publikováno v:
IndraStra Global.
The movement of defense establishments in a convoy can be explained using a mathematical model. During wartime or emergency situations, convoys move non-stop to their destinations except for minor routine halts for food and rest. The proposed Integer
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::535c9b7b63b496f8d6beb8fee6e0cdc1
https://igi.indrastra.com/items/show/77935
https://igi.indrastra.com/items/show/77935
Autor:
G. Srinivasan, T. T. Narendran
Publikováno v:
Handbook of Cellular Manufacturing Systems
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::267706cec84de43058ee4d070f56d1fe
https://doi.org/10.1002/9780470172476.ch2
https://doi.org/10.1002/9780470172476.ch2
Autor:
P.N. Ram Kumar, T. T. Narendran
Publikováno v:
International Journal of Intelligent Defence Support Systems. 1:177
This paper reports a study of the strategic network problem of routing military convoys between specific origin and destination pairs. Known as the Convoy Movement Problem (CMP), this problem is formulated as an integer linear program. The proposed m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0dfb9a383a8e41832127b2dfb2bddbde
https://doi.org/10.1504/ijidss.2008.023006
https://doi.org/10.1504/ijidss.2008.023006