Distributionally robust single machine scheduling with the total tardiness criterion
From MaRDI portal
Publication:1628037
DOI10.1016/j.cor.2018.08.007zbMath1458.90339OpenAlexW2885693251MaRDI QIDQ1628037
Yuli Zhang, Raymond Chiong, Shengsheng Niu, Jian-Ya Ding, Shi-ji Song
Publication date: 3 December 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2018.08.007
branch-and-boundbeam searchsingle machine schedulingtotal tardinessdistributionally robust optimization
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items
Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms, Distributionally Robust Optimization Under a Decision-Dependent Ambiguity Set with Applications to Machine Scheduling and Humanitarian Logistics, Computationally Efficient Approximations for Distributionally Robust Optimization Under Moment and Wasserstein Ambiguity, The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times, A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times, A hybrid genetic algorithm based on a two-level hypervolume contribution measure selection strategy for bi-objective flexible job shop problem, Distributionally robust scheduling algorithms for total flow time minimization on parallel machines using norm regularizations, Single machine scheduling with release dates: a distributionally robust approach, Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs, Optimally rescheduling jobs with a last-in-first-out buffer, Target-based distributionally robust optimization for single machine scheduling
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem
- Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints
- A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
- Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
- On the robust single machine scheduling problem
- Minimizing the number of tardy jobs with stochastically-ordered processing times
- Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem
- Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach
- Algorithms and complexity analysis for robust single-machine scheduling problems
- Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
- Complexity of single machine scheduling problems under scenario-based uncertainty
- A faster fully polynomial approximation scheme for the single-machine total tardiness problem
- A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem
- A branch and bound algorithm for the job-shop scheduling problem
- The stochastic single machine scheduling problem with earliness and tardiness costs
- Distributionally robust single machine scheduling with risk aversion
- A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine
- Robust scheduling on a single machine to minimize total flow time
- Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
- A family of inequalities valid for the robust single machine scheduling polyhedron
- Complexity of minimizing the total flow time with interval data and minmax regret criterion
- A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times
- Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
- A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
- Introduction to Stochastic Programming
- A new decomposition approach for the single machine total tardiness scheduling problem
- Minimizing Total Tardiness on One Machine is NP-Hard
- Tight Bounds for Some Risk Measures, with Applications to Robust Portfolio Selection
- An Application of Lagrangian Relaxation to Scheduling in Power-Generation Systems
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- New Precedence Theorems for One-Machine Weighted Tardiness
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- Algorithmic paradoxes of the single-machine total tardiness problem
- Stochastic single machine scheduling with an exponentially distributed due date
