Target-oriented robust satisficing models for the single machine scheduling problems with release time
From MaRDI portal
Publication:6568456
DOI10.1016/j.cor.2024.106642MaRDI QIDQ6568456
Publication date: 8 July 2024
Published in: Computers \& Operations Research (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
- Primal and dual linear decision rules in stochastic and robust optimization
- On the robust single machine scheduling problem
- An algorithm for single machine sequencing with release dates to minimize total weighted completion time
- Efficient heuristics to minimize total flow time with release dates
- A contribution to the stochastic flow shop scheduling problem.
- Adjustable robust solutions of uncertain linear programs
- Distributionally robust single machine scheduling with risk aversion
- Robust scheduling on a single machine to minimize total flow time
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- An iterative heuristic for the single machine dynamic total completion time scheduling problem
- Distributionally robust scheduling on parallel machines under moment uncertainty
- Due-window assignment scheduling problem with stochastic processing times
- Target-based distributionally robust optimization for single machine scheduling
- Dominance-based heuristics for one-machine total cost scheduling problems
- Data-driven risk-averse stochastic optimization with Wasserstein metric
- Robust single machine makespan scheduling with release date uncertainty
- The Sample Average Approximation Method for Stochastic Discrete Optimization
- Robust Optimization Made Easy with ROME
- Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
- Scheduling of a single machine to minimize total weighted completion time subject to release dates
- Effective heuristics for the single machine sequencing problem with ready times
- A Linear Decision-Based Approximation Approach to Stochastic Programming
- Managing Underperformance Risk in Project Portfolio Selection
- Stochastic Scheduling with Release Dates and Due Dates
- Robust Solutions to Uncertain Semidefinite Programs
- A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- Adjustable Robust Optimization via Fourier–Motzkin Elimination
- Robust Data-Driven Vehicle Routing with Time Windows
- Technical Note—Two-Stage Sample Robust Optimization
- Exact Algorithms for Distributionally β-Robust Machine Scheduling with Uncertain Processing Times
- Scheduling
- Globalized Distributionally Robust Counterpart
- Robust Satisficing
This page was built for publication: Target-oriented robust satisficing models for the single machine scheduling problems with release time