Scheduling chains on a single machine with non-negative time lags

DOI10.1007/s001860200242zbMath1114.90385OpenAlexW1986189899MaRDI QIDQ1395149

Francis Sourd, Alix Munier

Publication date: 26 June 2003

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

Full work available at URL: https://doi.org/10.1007/s001860200242

zbMATH Keywords

complexitydeterministic schedulingtime-lagssingle machine problems

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Job-shop scheduling in a body shop ⋮ Minimizing flowtime for paired tasks ⋮ Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay. ⋮ Scheduling coupled-operation jobs with exact time-lags ⋮ Scheduling chains with identical jobs and constant delays on a single machine ⋮ Scheduling with uncertain processing times in mixed-criticality systems ⋮ A framework for the complexity of high-multiplicity scheduling problems

This page was built for publication: Scheduling chains on a single machine with non-negative time lags