Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times

DOI10.1007/S10479-019-03263-6zbMATH Open1434.90113OpenAlexW2944472270WikidataQ127889529 ScholiaQ127889529MaRDI QIDQ2288971FDOQ2288971

Authors: Maciej Drwal, Jerzy Józefczyk 

Publication date: 20 January 2020

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-019-03263-6

Recommendations

• Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty
• The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
• Minimizing total weighted flow time of a set of jobs with interval processing times
• A robust identical parallel machine scheduling model based on min-max regret criterion
• Complexity of minimizing the total flow time with interval data and minmax regret criterion

zbMATH Keywords

uncertaintyrobust optimizationschedulingmixed integer programming

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11) Robustness in mathematical programming (90C17)

Cites Work

• Reducibility among Combinatorial Problems
• An overview of bilevel optimization
• Robust optimization
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Robust discrete optimization and its applications
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Title not available (Why is that?)
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Project scheduling under uncertainty: survey and research potentials
• Complexity of minimizing the total flow time with interval data and minmax regret criterion
• Scheduling algorithms
• On the complexity of a class of combinatorial optimization problems with uncertainty
• Complexity of single machine scheduling problems under scenario-based uncertainty
• Minmax scheduling problems with a common due-window
• Stochastic Scheduling with Release Dates and Due Dates
• Minimizing total weighted flow time of a set of jobs with interval processing times
• A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
• Discrete optimization with interval data. Minmax regret and fuzzy approach
• Pinpointing the complexity of the interval min-max regret knapsack problem
• On scheduling around large restrictive common due windows
• Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty
• Complexity of interval minmax regret scheduling on parallel identical machines with total completion time criterion
• Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem

Cited In (2)

• Minimizing total weighted flow time of a set of jobs with interval processing times
• A two-stage robust approach for minimizing the weighted number of tardy jobs with objective uncertainty

This page was built for publication: Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times

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