IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v40y1993i5p581-592.html
   My bibliography  Save this article

Assignment with En route training of navy personnel

Author

Listed:
  • Agha Iqbal Ali
  • Jeffery L. Kennington
  • Timothy T. Liang

Abstract

Each year over 200000 Navy enlisted personnel are assigned new jobs at a cost of over 250 million dollars in moving expenses. The task of selecting assignments is complicated by the fact that an individual can be sent to a technical school (which has a limited capacity) to obtain additional training which makes him eligible for additional jobs. The optimal assignment of Navy personnel with en route training is addressed via an assignment problem with specially structured side constraints. This article presents a new algorithm to solve the integer network problem which is based on resource‐directive decomposition in conjunction with Lagrangian relaxation. The new solution procedure is very fast compared to alternate methods. © 1993 John Wiley & Sons, Inc.

Suggested Citation

  • Agha Iqbal Ali & Jeffery L. Kennington & Timothy T. Liang, 1993. "Assignment with En route training of navy personnel," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(5), pages 581-592, August.
    • Handle: RePEc:wly:navres:v:40:y:1993:i:5:p:581-592
    DOI: 10.1002/1520-6750(199308)40:53.0.CO;2-#
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(199308)40:53.0.CO;2-#
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(199308)40:53.0.CO;2-#?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Agha Iqbal Ali & Rema Padman & Hemalatha Thiagarajan, 1989. "Dual Algorithms for Pure Network Problems," Operations Research, INFORMS, vol. 37(1), pages 159-171, February.
    2. Ali, Agha Iqbal & Kennington, Jeff & Shetty, Bala, 1988. "The equal flow problem," European Journal of Operational Research, Elsevier, vol. 36(1), pages 107-115, July.
    3. Liang, Timothy T. & Buclatin, Ben B., 1988. "Improving the utilization of training resources through optimal personnel assignment in the U.S. Navy," European Journal of Operational Research, Elsevier, vol. 33(2), pages 183-190, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ali, Agha Iqbal & blanco, Tom & Buclatin, Ben, 1998. "Goal network programs: A specialized algorithm and an application," European Journal of Operational Research, Elsevier, vol. 106(1), pages 191-197, April.
    2. Allen Holder, 2005. "Navy Personnel Planning and the Optimal Partition," Operations Research, INFORMS, vol. 53(1), pages 77-89, February.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ali, Agha Iqbal & blanco, Tom & Buclatin, Ben, 1998. "Goal network programs: A specialized algorithm and an application," European Journal of Operational Research, Elsevier, vol. 106(1), pages 191-197, April.
    2. Meyr, H., 2000. "Simultaneous lotsizing and scheduling by combining local search with dual reoptimization," European Journal of Operational Research, Elsevier, vol. 120(2), pages 311-326, January.
    3. O. Zeynep Akşin, 2007. "On valuing appreciating human assets in services," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(2), pages 221-235, March.
    4. David R. Morrison & Jason J. Sauppe & Sheldon H. Jacobson, 2013. "A Network Simplex Algorithm for the Equal Flow Problem on a Generalized Network," INFORMS Journal on Computing, INFORMS, vol. 25(1), pages 2-12, February.
    5. Sharma, R. R. K. & Sharma, K. D., 2000. "A new dual based procedure for the transportation problem," European Journal of Operational Research, Elsevier, vol. 122(3), pages 611-624, May.
    6. Marins, Fernando A. S. & Senne, Edson L. F. & Darby-Dowman, Ken & Machado, Arlene F. & Perin, Clovis, 1997. "Algorithms for network piecewise-linear programs: A comparative study," European Journal of Operational Research, Elsevier, vol. 97(1), pages 183-199, February.
    7. Gregory D. Glockner & George L. Nemhauser, 2000. "A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure," Operations Research, INFORMS, vol. 48(2), pages 233-242, April.
    8. B Karimi & S M T Fatemi Ghomi & J M Wilson, 2006. "A tabu search heuristic for solving the CLSP with backlogging and set-up carry-over," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(2), pages 140-147, February.
    9. Meyr, Herbert, 2002. "Simultaneous lotsizing and scheduling on parallel machines," European Journal of Operational Research, Elsevier, vol. 139(2), pages 277-292, June.
    10. Emilio Zamorano & Annika Becker & Raik Stolletz, 2018. "Task assignment with start time-dependent processing times for personnel at check-in counters," Journal of Scheduling, Springer, vol. 21(1), pages 93-109, February.
    11. Kraft, Edwin R., 2002. "Scheduling railway freight delivery appointments using a bid price approach," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(2), pages 145-165, February.
    12. Sharma, R. R. K. & Prasad, Saumya, 2003. "Obtaining a good primal solution to the uncapacitated transportation problem," European Journal of Operational Research, Elsevier, vol. 144(3), pages 560-564, February.
    13. Ernst, A. T. & Jiang, H. & Krishnamoorthy, M. & Sier, D., 2004. "Staff scheduling and rostering: A review of applications, methods and models," European Journal of Operational Research, Elsevier, vol. 153(1), pages 3-27, February.
    14. Yenisey, Mehmet Mutlu, 2006. "A flow-network approach for equilibrium of material requirements planning," International Journal of Production Economics, Elsevier, vol. 102(2), pages 317-332, August.
    15. K S Hindi & K Fleszar & C Charalambous, 2003. "An effective heuristic for the CLSP with set-up times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(5), pages 490-498, May.
    16. Antonio Manca & Giovanni Sechi & Paola Zuddas, 2010. "Water Supply Network Optimisation Using Equal Flow Algorithms," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 24(13), pages 3665-3678, October.
    17. Ahuja, Ravindra K., 1956-, 1997. "Algorithms for the simple equal flow problem," Working papers WP 3960-97., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    18. Rema Padman & Dwight E. Smith‐Daniels & Vicki L. Smith‐Daniels, 1997. "Heuristic scheduling of resource‐constrained projects with cash flows," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(4), pages 365-381, June.
    19. Ravindra K. Ahuja & James B. Orlin & Giovanni M. Sechi & Paola Zuddas, 1999. "Algorithms for the Simple Equal Flow Problem," Management Science, INFORMS, vol. 45(10), pages 1440-1455, October.
    20. Bala Shetty, 1990. "A relaxation/decomposition algorithm for the fixed charged network problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(2), pages 327-340, April.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navres:v:40:y:1993:i:5:p:581-592. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.