Min-max regret single machine scheduling with due-date assignment and interval processing times
From MaRDI portal
Cites work
- A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
- A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times
- A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines
- A survey of the state-of-the-art of common due date assignment and scheduling research
- A two-agent resource allocation scheduling problem with slack due-date assignment and general deterioration function
- Algorithmic Applications in Management
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Complexity of minimizing the total flow time with interval data and minmax regret criterion
- Due-date assignment and machine scheduling in a low machine-rate situation with stochastic processing times
- Due-date assignment with acceptable lead-times on parallel machines
- Due-window assignment scheduling problem with stochastic processing times
- Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times
- Job sequencing and due date assignment in a single machine shop with uncertain processing times
- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Minimizing earliness and tardiness costs in stochastic scheduling
- No-idle flow shop scheduling with deteriorating jobs and common due date under dominating machines
- Optimal assignment of slack due-dates and sequencing of jobs with random processing times on a single machine
- Optimal due-date assignment for a single machine sequencing problem with random processing times
- Optimal static priority rules for stochastic scheduling with impatience
- Research on multiple slack due-date assignments scheduling with position-dependent weights
- Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times
- Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
- Safe scheduling: Setting due dates in single-machine problems
- Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties
- Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs
- Setting due dates in a stochastic single machine environment
- Setting optimal due dates in a basic safe-scheduling model
- Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work
- Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
- Trading off due-date tightness and job tardiness in a basic scheduling model
This page was built for publication: Min-max regret single machine scheduling with due-date assignment and interval processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7313677)
