Scheduling chains on a single machine with non-negative time lags
From MaRDI portal
Publication:1395149
DOI10.1007/S001860200242zbMATH Open1114.90385OpenAlexW1986189899MaRDI QIDQ1395149FDOQ1395149
Authors: Francis Sourd, A. 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
Recommendations
- Scheduling chains with identical jobs and constant delays on a single machine
- On single-machine scheduling without intermediate delays
- scientific article; zbMATH DE number 1594558
- Non-preemptive scheduling on machines with setup times
- Single-machine scheduling with release times and tails
- Single-machine scheduling to stochastically minimize maximum lateness
- Scheduling chains on uniform processors with communication delays
- scientific article; zbMATH DE number 850322
- A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags
- scientific article; zbMATH DE number 1187294
Cited In (9)
- A framework for the complexity of high-multiplicity scheduling problems
- Job-shop scheduling in a body shop
- Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay.
- Scheduling coupled-operation jobs with exact time-lags
- Minimizing flowtime for paired tasks
- Complexity results for single-machine problems with positive finish-start time-lags
- Scheduling with uncertain processing times in mixed-criticality systems
- Scheduling chains with identical jobs and constant delays on a single machine
- The composition chain algorithm and a class of single batch machine scheduling problems with chain precedence constraints
This page was built for publication: Scheduling chains on a single machine with non-negative time lags
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1395149)
