Scheduling in multi-scenario environment with an agreeable condition on job processing times
type: Item
instance of: scholarly article
title: Scheduling in multi-scenario environment with an agreeable condition on job processing times
zbMATH Open document ID: 1481.90169
author: Miri Gilenson
author: Dvir Shabtay
author: Liron Yedidsion
author: Rohit Malshe
published in: Annals of Operations Research
publication date: 2022-01-24T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90B36
Mathematics Subject Classification ID: 90B30
zbMATH DE Number: 7462450
zbMATH Keywords: scheduling
zbMATH Keywords: single-machine
zbMATH Keywords: flow-shop
zbMATH Keywords: multi-scenario
zbMATH Keywords: agreeable condition
zbMATH Keywords: \( \mathcal{NP} \)-hard
MaRDI profile type: Publication
full work available at URL: s10479-021-04316-5
OpenAlex ID: W3211234969
cites work: Complexity of single machine scheduling problems under scenario-based uncertainty
cites work: Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
cites work: A family of inequalities valid for the robust single machine scheduling polyhedron
cites work: Scheduling stochastic jobs with due dates on parallel machines
cites work: An approximation scheme for the bi-scenario sum of completion times trade-off problem
cites work: Scheduling tasks with exponential service times on parallel processors
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Parameterized multi-scenario single-machine scheduling problems
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors
cites work: Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
cites work: Robust scheduling on a single machine to minimize total flow time
cites work: Single machine scheduling with scenarios
cites work: An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
cites work: Unrelated Machine Scheduling with Stochastic Processing Times
cites work: On the robust single machine scheduling problem
DOI: 10.1007/S10479-021-04316-5
Recommended article: Scheduling jobs with agreeable processing times and due dates on a single batch processing machine
Recommended article: A state-of-the-art survey on multi-scenario scheduling
Recommended article: Multi-objective stochastic scheduling of job ready times
Recommended article: Q3809574
Recommended article: A mathematical programming-based scheduling framework for multitasking environments
Recommended article: Scheduling over Scenarios on Two Machines
Recommended article: Q3804433
Recommended article: Multi-machine scheduling with interval constrained position-dependent processing times
Recommended article: Scheduling with agreeable release times and due dates on a batch processing machine
description: scientific article; zbMATH DE number 7462450