Distributionally robust single machine scheduling with the total tardiness criterion

DOI10.1016/J.COR.2018.08.007zbMATH Open1458.90339OpenAlexW2885693251MaRDI QIDQ1628037FDOQ1628037

Authors: Shengsheng Niu, Jian-Ya Ding, Yuli Zhang, Raymond Chiong, Shiji 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

Recommendations

• Target-based distributionally robust optimization for single machine scheduling
• Distributionally robust single machine scheduling with risk aversion
• Distributionally robust scheduling on parallel machines under moment uncertainty
• Exact algorithms for distributionally \(\beta \)-robust machine scheduling with uncertain processing times
• Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty

zbMATH Keywords

single machine schedulingtotal tardinessbranch-and-boundbeam searchdistributionally robust optimization

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)
• On duality theory of conic linear problems.
• Introduction to stochastic programming.
• Tight bounds for some risk measures, with applications to robust portfolio selection
• Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation
• 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
• Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
• Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem
• Minimizing Total Tardiness on One Machine is NP-Hard
• On the robust single machine scheduling problem
• Complexity of single machine scheduling problems under scenario-based uncertainty
• A branch and bound algorithm for the job-shop scheduling problem
• Robust scheduling on a single machine to minimize total flow time
• A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem
• A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine
• A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times
• Title not available (Why is that?)
• Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics
• Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints
• Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
• Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• Algorithms and complexity analysis for robust single-machine scheduling problems
• The stochastic single machine scheduling problem with earliness and tardiness costs
• A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties
• New Precedence Theorems for One-Machine Weighted Tardiness
• Algorithmic paradoxes of the single-machine total tardiness problem
• Stochastic single machine scheduling with an exponentially distributed due date
• Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach
• A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
• The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
• Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem
• An Application of Lagrangian Relaxation to Scheduling in Power-Generation Systems
• A faster fully polynomial approximation scheme for the single-machine total tardiness problem
• Title not available (Why is that?)
• A new decomposition approach for the single machine total tardiness scheduling problem
• Minimizing the number of tardy jobs with stochastically-ordered processing times
• Distributionally robust single machine scheduling with risk aversion

Cited In (19)

• Exact algorithms for distributionally \(\beta \)-robust machine scheduling with uncertain processing times
• Distributionally robust scheduling on parallel machines under moment uncertainty
• Computationally Efficient Approximations for Distributionally Robust Optimization Under Moment and Wasserstein Ambiguity
• Single machine scheduling with release dates: a distributionally robust approach
• A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
• Robust single machine makespan scheduling with release date uncertainty
• Distributionally robust scheduling algorithms for total flow time minimization on parallel machines using norm regularizations
• Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms
• A distributionally robust approach for the two-machine permutation flow shop scheduling
• Distributionally robust single machine scheduling with risk aversion
• Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty
• A hybrid genetic algorithm based on a two-level hypervolume contribution measure selection strategy for bi-objective flexible job shop problem
• Distributionally Robust Optimization Under a Decision-Dependent Ambiguity Set with Applications to Machine Scheduling and Humanitarian Logistics
• 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
• Optimally rescheduling jobs with a last-in-first-out buffer
• A robust approach for the single machine scheduling problem
• Target-based distributionally robust optimization for single machine scheduling
• Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs

This page was built for publication: Distributionally robust single machine scheduling with the total tardiness criterion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1628037)