IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v48y2018i5p467-483.html
   My bibliography  Save this article

The Inmate Assignment and Scheduling Problem and Its Application in the Pennsylvania Department of Corrections

Author

Listed:
  • Mohammad Shahabsafa

    (Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, Pennsylvania 18015)

  • Tamás Terlaky

    (Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, Pennsylvania 18015)

  • Naga Venkata Chaitanya Gudapati

    (Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, Pennsylvania 18015)

  • Anshul Sharma

    (Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, Pennsylvania 18015)

  • George R. Wilson

    (Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, Pennsylvania 18015)

  • Louis J. Plebani

    (Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, Pennsylvania 18015)

  • Kristofer B. Bucklen

    (Pennsylvania Department of Corrections, Mechanicsburg, Pennsylvania 17050)

Abstract

The inmate assignment project, in close collaboration with the Pennsylvania Department of Corrections (PADoC), took five years from start to successful implementation. In this project we developed the Inmate Assignment Decision Support System (IADSS), for which the primary goal is simultaneous and system-wide optimal assignment of inmates to correctional institutions (CIs). We develop a novel hierarchical, multiobjective mixed-integer linear optimization (MILO) model, which accurately describes the inmate assignment problem (IAP). The IAP is the mathematical optimization formulation of the problem every correctional system faces, which is to assign inmates to CIs and schedule their programs, while considering all legal restrictions and best practice constraints. By using actual inmate data sets from the PADoC, we also demonstrate that the MILO model can be solved efficiently. IADSS enables the PADoC to significantly reduce the inmate population management costs and enhance public safety and security of the CIs. To the best of our knowledge this is the first time that operations research methodologies have been incorporated into the routine business practice of a correctional system and used to optimize its operations. This successful project opens a rich and untouched area for the application of operations research and optimization methodology. The new model and methodology can be utilized for the assignment of inmates in any correctional system.

Suggested Citation

  • Mohammad Shahabsafa & Tamás Terlaky & Naga Venkata Chaitanya Gudapati & Anshul Sharma & George R. Wilson & Louis J. Plebani & Kristofer B. Bucklen, 2018. "The Inmate Assignment and Scheduling Problem and Its Application in the Pennsylvania Department of Corrections," Interfaces, INFORMS, vol. 48(5), pages 467-483, October.
    • Handle: RePEc:inm:orinte:v:48:y:2018:i:5:p:467-483
    DOI: 10.1287/inte.2018.0962
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/inte.2018.0962
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.2018.0962?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. J. P. Arabeyre & J. Fearnley & F. C. Steiger & W. Teather, 1969. "The Airline Crew Scheduling Problem: A Survey," Transportation Science, INFORMS, vol. 3(2), pages 140-163, May.
    2. Alberto Caprara & Paolo Toth & Daniele Vigo & Matteo Fischetti, 1998. "Modeling and Solving the Crew Rostering Problem," Operations Research, INFORMS, vol. 46(6), pages 820-830, December.
    3. H. W. Kuhn, 1955. "The Hungarian method for the assignment problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 2(1‐2), pages 83-97, March.
    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. Shany Azaria & Boaz Ronen & Noam Shamir, 2024. "Alleviating Court Congestion: The Case of the Jerusalem District Court," Interfaces, INFORMS, vol. 54(3), pages 267-281, May.
    2. Najmaddin Akhundov & Nail Tahirov & Christoph H. Glock, 2022. "Optimal Scheduling of Waitstaff with Different Experience Levels at a Restaurant Chain," Interfaces, INFORMS, vol. 52(4), pages 324-343, July.

    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. Cynthia Barnhart & Peter Belobaba & Amedeo R. Odoni, 2003. "Applications of Operations Research in the Air Transport Industry," Transportation Science, INFORMS, vol. 37(4), pages 368-391, November.
    2. Maenhout, Broos & Vanhoucke, Mario, 2010. "A hybrid scatter search heuristic for personalized crew rostering in the airline industry," European Journal of Operational Research, Elsevier, vol. 206(1), pages 155-167, October.
    3. M Lezaun & G Pérez & E Sáinz de la Maza, 2010. "Staff rostering for the station personnel of a railway company," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(7), pages 1104-1111, July.
    4. András Frank, 2005. "On Kuhn's Hungarian Method—A tribute from Hungary," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(1), pages 2-5, February.
    5. Amit Kumar & Anila Gupta, 2013. "Mehar’s methods for fuzzy assignment problems with restrictions," Fuzzy Information and Engineering, Springer, vol. 5(1), pages 27-44, March.
    6. Parvin Ahmadi & Iman Gholampour & Mahmoud Tabandeh, 2018. "Cluster-based sparse topical coding for topic mining and document clustering," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 12(3), pages 537-558, September.
    7. Chenchen Ma & Jing Ouyang & Gongjun Xu, 2023. "Learning Latent and Hierarchical Structures in Cognitive Diagnosis Models," Psychometrika, Springer;The Psychometric Society, vol. 88(1), pages 175-207, March.
    8. Aidin Rezaeian & Hamidreza Koosha & Mohammad Ranjbar & Saeed Poormoaied, 2024. "The assignment of project managers to projects in an uncertain dynamic environment," Annals of Operations Research, Springer, vol. 341(2), pages 1107-1134, October.
    9. Tran Hoang Hai, 2020. "Estimation of volatility causality in structural autoregressions with heteroskedasticity using independent component analysis," Statistical Papers, Springer, vol. 61(1), pages 1-16, February.
    10. Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar, 2015. "A set covering approach for multi-depot train driver scheduling," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 636-654, April.
    11. Caplin, Andrew & Leahy, John, 2020. "Comparative statics in markets for indivisible goods," Journal of Mathematical Economics, Elsevier, vol. 90(C), pages 80-94.
    12. Biró, Péter & Gudmundsson, Jens, 2021. "Complexity of finding Pareto-efficient allocations of highest welfare," European Journal of Operational Research, Elsevier, vol. 291(2), pages 614-628.
    13. Péter Biró & Flip Klijn & Xenia Klimentova & Ana Viana, 2021. "Shapley-Scarf Housing Markets: Respecting Improvement, Integer Programming, and Kidney Exchange," Working Papers 1235, Barcelona School of Economics.
    14. Michal Brylinski, 2014. "eMatchSite: Sequence Order-Independent Structure Alignments of Ligand Binding Pockets in Protein Models," PLOS Computational Biology, Public Library of Science, vol. 10(9), pages 1-15, September.
    15. Zeren, Bahadır & Özcan, Ender & Deveci, Muhammet, 2024. "An adaptive greedy heuristic for large scale airline crew pairing problems," Journal of Air Transport Management, Elsevier, vol. 114(C).
    16. Chiwei Yan & Helin Zhu & Nikita Korolko & Dawn Woodard, 2020. "Dynamic pricing and matching in ride‐hailing platforms," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(8), pages 705-724, December.
    17. Fanrong Xie & Anuj Sharma & Zuoan Li, 2022. "An alternate approach to solve two-level priority based assignment problem," Computational Optimization and Applications, Springer, vol. 81(2), pages 613-656, March.
    18. Panta Lučić & Dušan Teodorović, 2007. "Metaheuristics approach to the aircrew rostering problem," Annals of Operations Research, Springer, vol. 155(1), pages 311-338, November.
    19. Yan, Pengyu & Lee, Chung-Yee & Chu, Chengbin & Chen, Cynthia & Luo, Zhiqin, 2021. "Matching and pricing in ride-sharing: Optimality, stability, and financial sustainability," Omega, Elsevier, vol. 102(C).
    20. Morrill, Thayer & Roth, Alvin E., 2024. "Top trading cycles," Journal of Mathematical Economics, Elsevier, vol. 112(C).

    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:inm:orinte:v:48:y:2018:i:5:p:467-483. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.