scientific article; zbMATH DE number 2080249

MaRDI QIDQ4472496zbMATH OpenFDO

Authors Thomas Erlebach, Frits C. R. Spieksma

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1969/19690228.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Interval selection: Applications, algorithms, and lower bounds
• scientific article; zbMATH DE number 2119734
• An improved randomized on-line algorithm for a weighted interval selection problem
• Scheduling Split Intervals
• Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems

Cited in

(6)

• Online C-benevolent job scheduling on multiple machines
• Primal-dual approximation algorithms for a packing-covering pair of problems
• Interval selection: Applications, algorithms, and lower bounds
• Scheduling Split Intervals
• Efficient job scheduling algorithms with multi-type contentions
• Fixed interval scheduling: models, applications, computational complexity and algorithms

This page was built for publication:

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