A state-of-the-art survey on multi-scenario scheduling
From MaRDI portal
Publication:6113303
DOI10.1016/j.ejor.2022.11.014OpenAlexW4309279635MaRDI QIDQ6113303
Publication date: 11 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2022.11.014
Cites Work
- Single machine scheduling problems with uncertain parameters and the OWA criterion
- Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty
- The just-in-time scheduling problem in a flow-shop scheduling system
- Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
- Minimizing the number of late jobs on a single machine under due date uncertainty
- On the robust single machine scheduling problem
- Scheduling stochastic jobs with due dates on parallel machines
- A robust two-machine flow-shop scheduling model with scenario-dependent processing times
- Maximizing the weighted number of just-in-time jobs in flow shop scheduling
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- Complexity of single machine scheduling problems under scenario-based uncertainty
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- The single-machine total tardiness scheduling problem: review and extensions
- Approximation results for a bicriteria job scheduling problem on a single machine without preemption
- Approximation schemes for scheduling on parallel machines
- Robust discrete optimization and network flows
- Minmax regret solutions for minimax optimization problems with uncertainty
- Minimizing worst-case and average-case makespan over scenarios
- Robust single machine scheduling with a flexible maintenance activity
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Robust scheduling on a single machine to minimize total flow time
- Parameterized complexity of machine scheduling: 15 open problems
- Two dimensional load balancing
- Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time
- Single machine scheduling to minimize the number of early and tardy jobs
- Approximating the min-max (regret) selecting items problem
- Single machine scheduling with scenarios
- A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine
- A single-machine scheduling problem with uncertainty in processing times and outsourcing costs
- Scheduling in multi-scenario environment with an agreeable condition on job processing times
- 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
- On the parameterized tractability of the just-in-time flow-shop scheduling problem
- Multicriteria scheduling
- Robust Single Machine Scheduling Problem with Weighted Number of Late Jobs Criterion
- Optimal two- and three-stage production schedules with setup times included
- JUST-IN-TIME SCHEDULING UNDER SCENARIO-BASED UNCERTAINTY
- Review of the ordered and proportionate flow shop scheduling research
- Parallel Machine Scheduling under Uncertainty
- Unrelated Machine Scheduling with Stochastic Processing Times
- Minimizing Total Tardiness on One Machine is NP-Hard
- Scheduling tasks with exponential service times on parallel processors
- Interval scheduling: A survey
- Resource-Constrained Assignment Scheduling
- On ordered weighted averaging aggregation operators in multicriteria decisionmaking
- Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel Processors
- Single Machine Scheduling to Minimize Total Late Work
- Algorithms for Scheduling Independent Tasks
- Open Shop Scheduling to Minimize Finish Time
- Flowshop and Jobshop Schedules: Complexity and Approximation
- The Complexity of Flowshop and Jobshop Scheduling
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
- On Multidimensional Packing Problems
- Techniques for scheduling with rejection
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- Reducibility among Combinatorial Problems
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Algorithms and Data Structures
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A state-of-the-art survey on multi-scenario scheduling