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

DOI10.1007/S10951-018-0588-7zbMATH Open1427.90142OpenAlexW2896194150WikidataQ59281084 ScholiaQ59281084MaRDI QIDQ2283294FDOQ2283294

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

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

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)

Cites Work

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

Cited In (4)

• An exact algorithm for the bi-objective timing problem
• A state-of-the-art survey on multi-scenario scheduling
• 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)