Scheduling in multi-scenario environment with an agreeable condition on job processing times

DOI10.1007/s10479-021-04316-5zbMath1481.90169OpenAlexW3211234969MaRDI QIDQ2070719

Miri Gilenson, Rohit Malshe, Dvir Shabtay, Liron Yedidsion

Publication date: 24 January 2022

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-021-04316-5

zbMATH Keywords

schedulingsingle-machineflow-shopmulti-scenario\( \mathcal{NP} \)-hardagreeable condition

Mathematics Subject Classification ID

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

Related Items (2)

A state-of-the-art survey on multi-scenario scheduling ⋮ Unnamed Item

Cites Work

• Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
• On the robust single machine scheduling problem
• Scheduling stochastic jobs with due dates on parallel machines
• Complexity of single machine scheduling problems under scenario-based uncertainty
• Robust scheduling on a single machine to minimize total flow time
• Single machine scheduling with scenarios
• Parameterized multi-scenario single-machine scheduling problems
• A family of inequalities valid for the robust single machine scheduling polyhedron
• An approximation scheme for the bi-scenario sum of completion times trade-off problem
• Optimal two- and three-stage production schedules with setup times included
• Unrelated Machine Scheduling with Stochastic Processing Times
• Scheduling tasks with exponential service times on parallel processors
• Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs

This page was built for publication: Scheduling in multi-scenario environment with an agreeable condition on job processing times