Characterizing the set of feasible sequences for n jobs to be carried out on a single machine

DOI10.1016/0377-2217(80)90005-3zbMath0425.90053OpenAlexW2013378725MaRDI QIDQ1135762

J. P. Vernhes, François Roubellat, Jacques Erschler

Publication date: 1980

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(80)90005-3

zbMATH Keywords

schedulingsingle machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Applying new dominance concepts to job schedule optimization ⋮ Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics ⋮ Local adjustments: A general algorithm ⋮ An efficient ILP formulation for the single machine scheduling problem ⋮ On not-first/not-last conditions in disjunctive scheduling ⋮ A branch and bound to minimize the number of late jobs on a single machine with release time constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Alternative Formulation of the Job Shop Problem with Due Dates
• Technical Note—Finding Some Essential Characteristics of the Feasible Solutions for a Scheduling Problem
• Review of sequencing research