Zobrazeno 1 - 10
of 296
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
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
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,
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
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
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
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
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:
YounesSinaki, Roohollah1,2 (AUTHOR), Sadeghi, Azadeh1 (AUTHOR) sadeghia@umich.edu, Mosadegh, Hadi3 (AUTHOR), Almasarwah, Najat4 (AUTHOR), Suer, Gursel2 (AUTHOR)
Publikováno v:
International Journal of Production Research. Aug2023, Vol. 61 Issue 16, p5585-5636. 52p. 5 Diagrams, 7 Charts, 12 Graphs.