A Greedy On-Line Algorithm for thek-Track Assignment Problem

DOI10.1006/JAGM.1998.1001zbMATH Open0928.68125OpenAlexW2120501415MaRDI QIDQ4240132FDOQ4240132

Authors: U. Faigle, Walter Kern, Willem M. Nawijn 

Publication date: 12 January 2000

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1998.1001

Recommendations

• Note on scheduling intervals on-line
• The \(k\)-track assignment problem
• scientific article; zbMATH DE number 1003261

zbMATH Keywords

scheduling\(k\)-track assignmentgreedy on-line algorithms

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cited In (6)

• Working time constraints in operational fixed job scheduling
• A fixed job scheduling problem with machine-dependent job weights
• On the online track assignment problem
• On-line scheduling of jobs with fixed start and end times
• Fixed interval scheduling: models, applications, computational complexity and algorithms
• The \(k\)-Track assignment problem on partial orders

This page was built for publication: A Greedy On-Line Algorithm for thek-Track Assignment Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4240132)