IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v50y2025i5d10.1007_s10878-025-01367-3.html
   My bibliography  Save this article

A comparative computational study for parallel-machine problems with sustainable manufacturing constraints

Author

Listed:
  • Levi R. Abreu

    (Federal University of Ceará, Department of Industrial Engineering)

  • Bruno A. Prata

    (Federal University of Ceará, Department of Industrial Engineering)

Abstract

Recently, several industrial engineering practitioners have focused on sustainable manufacturing environments that arise in various real-world scenarios. Sustainability constraints are usually related to the consumption of non-renewable resources, energy tariffs, or carbon emissions. In this paper, we present an extensive computational evaluation of identical parallel machine scheduling problems with controllable processing times and limited resource constraints. We assess two objective functions: minimizing makespan and total tardiness. Given the NP-hardness of the variants under study, we develop two mixed-integer linear programming (MILP) models and three constraint programming (CP) models. Two statistics are used as performance indicators: the Average Relative Percentage Deviation and the Success Rate. Based on the computational evaluation of 2250 randomly generated test instances, the third CP model presented the best results for the makespan objective, and the second CP model returned the best solution for the total tardiness objective. Usually, the CP models outperformed the MILP models for most of the test instances under evaluation. Graphical abstract

Suggested Citation

  • Levi R. Abreu & Bruno A. Prata, 2025. "A comparative computational study for parallel-machine problems with sustainable manufacturing constraints," Journal of Combinatorial Optimization, Springer, vol. 50(5), pages 1-40, December.
    • Handle: RePEc:spr:jcomop:v:50:y:2025:i:5:d:10.1007_s10878-025-01367-3
    DOI: 10.1007/s10878-025-01367-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-025-01367-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-025-01367-3?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

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:spr:jcomop:v:50:y:2025:i:5:d:10.1007_s10878-025-01367-3. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.