IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v76y2025i10p2183-2200.html
   My bibliography  Save this article

A bi-objective scheduling-sharing optimization model for criminal court planning under uncertainty

Author

Listed:
  • Zeinab Lashgari
  • Behnam Vahdani
  • Habib Reza Gholami
  • Maghsoud Amiri

Abstract

This research brings in a new scheme for organizing and scheduling the handling of criminal cases in a judiciary system. To achieve this, an unparalleled, bi-objective mathematical model is developed for scheduling criminal cases in various courts and prosecutor’s offices. This involves taking into account a wide range of practical processes and characteristics, including how judicial cases are organized, the variety of lawsuits and their related cases, judges with various specializations, specialized courtrooms, the frequency of case reviews in courts, the priority of cases, the permissible waiting times for investigation of crimes, the completion of investigation, issuance of indictment, handling cases, rendering verdicts, and the filing of objections. What is more, owing to the large number and diversity of cases, a sharing approach is incorporated into the scheduling process to provide an equitable burden across the courts’ chambers. Additionally, the set-induced robust optimization method is employed to address the uncertainty of the case handling time, which is an indisputable issue in designing such a task. Lastly, the validity and application of the suggested model are demonstrated by an analysis of a real case study of Iran’s judiciary system. Findings showed that the sharing approach can decrease surplus service capacity by 28%.

Suggested Citation

  • Zeinab Lashgari & Behnam Vahdani & Habib Reza Gholami & Maghsoud Amiri, 2025. "A bi-objective scheduling-sharing optimization model for criminal court planning under uncertainty," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 76(10), pages 2183-2200, October.
  • Handle: RePEc:taf:tjorxx:v:76:y:2025:i:10:p:2183-2200
    DOI: 10.1080/01605682.2025.2461226
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2025.2461226
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/01605682.2025.2461226?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
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    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:taf:tjorxx:v:76:y:2025:i:10:p:2183-2200. 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.

    We have no bibliographic references for this item. You can help adding them by using 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.