Approximating multi-scenario efficient solutions for an uncertain bi-criteria parallel machine scheduling problem

DOI10.1007/S10878-026-01436-1MaRDI QIDQ7314346zbMATH OpenFDO

Authors Xiechen Zhang, Eric Angel, Feng Chu, Damien Regnault

Publication date 14 August 2026

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10878-026-01436-1

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Multi-objective and goal programming (90C29)

Cites work

• A combinatorial bound for linear programming and related problems
• Algorithms for Scheduling Independent Tasks
• Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time
• Approximation Methods for Multiobjective Optimization Problems: A Survey
• Bicriteria approximation algorithms for scheduling problems with communications delays
• Dominance for multi-objective robust optimization concepts
• Efficient solutions in uncertain multiobjective optimization with countably many scenarios
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• scientific article; zbMATH DE number 5712306 (Why is no real title available?)
• scientific article; zbMATH DE number 2102785 (Why is no real title available?)
• Minimizing total completion time and makespan for a multi-scenario bi-criteria parallel machine scheduling problem
• Multicriteria Optimization
• On the approximability of trade-offs and optimal access of web sources
• On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
• On the existence of schedules that are near-optimal for both makespan and total weighted completion time
• On the Minimization of the Makespan Subject to Flowtime Optimality
• One-exact approximate Pareto sets
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Pareto solutions in multicriteria optimization under uncertainty
• Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts
• Small approximate Pareto sets for biobjective shortest paths and other problems
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

This page was built for publication: Approximating multi-scenario efficient solutions for an uncertain bi-criteria parallel machine scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7314346)