Min-max regret single machine scheduling with due-date assignment and interval processing times (Q7313677)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Min-max regret single machine scheduling with due-date assignment and interval processing times

scientific article; zbMATH DE number 8239364

Language	Label	Description	Also known as
default for all languages	No label defined
English	Min-max regret single machine scheduling with due-date assignment and interval processing times	scientific article; zbMATH DE number 8239364

Statements

instance of

scholarly article

0 references

title

Min-max regret single machine scheduling with due-date assignment and interval processing times (English)

0 references

0 references

0 references

Asia-Pacific Journal of Operational Research

0 references

publication date

13 August 2026

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Min-max and min-max regret versions of combinatorial optimization problems: A survey

0 references

Heuristics for the two-machine flowshop scheduling problem to minimise makespan with bounded processing times

0 references

Minimizing earliness and tardiness costs in stochastic scheduling

0 references

Setting optimal due dates in a basic safe-scheduling model

0 references

Safe scheduling: Setting due dates in single-machine problems

0 references

Trading off due-date tightness and job tardiness in a basic scheduling model

0 references

Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early-tardy penalties

0 references

Optimal due-date assignment for a single machine sequencing problem with random processing times

0 references

Optimal assignment of slack due-dates and sequencing of jobs with random processing times on a single machine

0 references

A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines

0 references

Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production

0 references

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

0 references

A survey of the state-of-the-art of common due date assignment and scheduling research

0 references

Due-date assignment and machine scheduling in a low machine-rate situation with stochastic processing times

0 references

A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion

0 references

Complexity of minimizing the total flow time with interval data and minmax regret criterion

0 references

A two-agent resource allocation scheduling problem with slack due-date assignment and general deterioration function

0 references

No-idle flow shop scheduling with deteriorating jobs and common due date under dominating machines

0 references

Due-date assignment with acceptable lead-times on parallel machines

0 references

Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem

0 references

The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective

0 references

Setting due dates in a stochastic single machine environment

0 references

Optimal static priority rules for stochastic scheduling with impatience

0 references

Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work

0 references

Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion

0 references

Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs

0 references

Research on multiple slack due-date assignments scheduling with position-dependent weights

0 references

Algorithmic Applications in Management

0 references

Job sequencing and due date assignment in a single machine shop with uncertain processing times

0 references

Due-window assignment scheduling problem with stochastic processing times

0 references

A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times

0 references

Identifiers

DOI

10.1142/S0217595925500459

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Min-max regret single machine scheduling with due-date assignment and interval processing times