Minimizing total completion time and makespan for a multi-scenario bi-criteria parallel machine scheduling problem

Xiechen Zhang, Eric Angel, Feng Chu and Damien Regnault

European Journal of Operational Research, 2025, vol. 321, issue 2, 397-406

Abstract: Multi-criteria scheduling problems under uncertainty remain a relatively unexplored topic in theoretical computer science despite substantial practical interests. This work studies a bi-objective identical parallel machine scheduling problem under uncertainty, in which the first objective is to minimize the total completion time, and the second is to minimize the makespan. Especially a job’s processing time is assumed to be represented by a polynomial function with respect to scenario u∈U, where U⊂R+ is an interval containing an infinite number of scenarios.

Keywords: Scheduling; Identical parallel machines; Multi-criteria; Uncertainty; Approximation algorithm (search for similar items in EconPapers)
Date: 2025
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221724007355
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:321:y:2025:i:2:p:397-406

DOI: 10.1016/j.ejor.2024.09.032

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().