A New Dominance Concept in Scheduling n Jobs on a Single Machine with Ready Times and Due Dates

DOI10.1287/opre.31.1.114zbMath0495.90046OpenAlexW1984884109MaRDI QIDQ3959730

C. Mercé, Jacques Erschler, G. Fontan, François Roubellat

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1287/opre.31.1.114

zbMATH Keywords

single machinescheduling of jobslimit timesdominance relationshipspecified ready time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

A robust approach for the single machine scheduling problem ⋮ Improving schedule stability in single-machine rescheduling for new operation insertion ⋮ Reducibility among single machine weighted completion time scheduling problems ⋮ Pareto optima for total weighted completion time and maximum lateness on a single machine ⋮ Single machine scheduling with release times, deadlines and tardiness objectives ⋮ An efficient ILP formulation for the single machine scheduling problem ⋮ A new dominance rule to minimize total weighted tardiness with unequal release dates. ⋮ A new sufficient condition of optimality for the two-machine flowshop problem ⋮ Pre-scheduling