An approximation scheme for the bi-scenario sum of completion times trade-off problem

DOI10.1007/S10951-018-0588-7MaRDI QIDQ2283294zbMATH OpenOpenAlexWikidataFDO

Authors Miri Gilenson, Hussein Naseraldin, Liron Yedidsion

Publication date 30 December 2019

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10951-018-0588-7

zbMATH Keywords

approximationPTASPareto-optimalsum of completion timesbi-scenario

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Single machine scheduling with scenarios
• Scheduling over scenarios on two machines
• Approximating Single Machine Scheduling with Scenarios
• Parallel machine scheduling under uncertainty
• Just-in-time scheduling under scenario-based uncertainty

Cites work

• scientific article; zbMATH DE number 52239 (Why is no real title available?)
• A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One
• A family of inequalities valid for the robust single machine scheduling polyhedron
• A note on scheduling to meet two min-sum objectives
• A survey and annotated bibliography of multiobjective combinatorial optimization
• Approximation results for a bicriteria job scheduling problem on a single machine without preemption
• Diversity Maximization Approach for Multiobjective Optimization
• Multicriteria scheduling
• Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
• On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
• On the robust single machine scheduling problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
• Single machine scheduling problems with uncertain parameters and the OWA criterion
• Single machine scheduling with scenarios

Cited in

(4)

• A state-of-the-art survey on multi-scenario scheduling
• An exact algorithm for the bi-objective timing problem
• Scheduling in multi-scenario environment with an agreeable condition on job processing times
• Parameterized multi-scenario single-machine scheduling problems

This page was built for publication: An approximation scheme for the bi-scenario sum of completion times trade-off problem

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