Job shop scheduling with unit length tasks: bounds and algorithms

MaRDI QIDQ5755525zbMATH OpenFDO

Authors Juraj Hromkovič, Tobias Mömke, K. Steinhöfel, Peter Widmayer

Publication date 13 August 2007

Full work available at URL http://journals.hil.unb.ca/index.php/AOR/article/view/2729

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 2044495
• Job shop scheduling with unit length tasks
• On the power of randomization for job shop scheduling withk-units length tasks
• Job shop scheduling with unit processing times
• Job Shop Scheduling with Unit Processing Times

Cited in

(12)

• Complexity, bounds and dynamic programming algorithms for single track train scheduling
• Job shop scheduling with unit length tasks
• Job shop scheduling with unit processing times
• A technique to obtain hardness results for randomized online algorithms -- a survey
• Advice complexity and barely random algorithms
• On the power of randomization for job shop scheduling withk-units length tasks
• scientific article; zbMATH DE number 2044495 (Why is no real title available?)
• scientific article; zbMATH DE number 1775452 (Why is no real title available?)
• Advice complexity and barely random algorithms
• Online algorithms with advice: the tape model
• Job Shop Scheduling with Unit Processing Times
• Firefly-Inspired Algorithm for Job Shop Scheduling

This page was built for publication: Job shop scheduling with unit length tasks: bounds and algorithms

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