scientific article; zbMATH DE number 2044495

MaRDI QIDQ4448359zbMATH OpenFDO

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

Publication date 18 February 2004

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

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Job shop scheduling with unit length tasks: bounds and algorithms
• Job shop scheduling with unit length tasks
• Job Shop Scheduling with Unit Processing Times
• Job shop scheduling with unit processing times
• Job shop scheduling with unit time operations under resource constraints and release dates
• Scheduling unit length jobs with parallel nested machine processing set restrictions
• Scheduling unit-length jobs with machine eligibility restrictions
• Scheduling unit processing time jobs on an m-machine flow-shop
• scientific article; zbMATH DE number 5669900
• Better approximation guarantees for job-shop scheduling

Cited in

(8)

• Advice complexity of fine-grained job shop scheduling
• Job Shop Scheduling with Unit Processing Times
• On the power of randomization for job shop scheduling withk-units length tasks
• Job shop scheduling with unit length tasks: bounds and algorithms
• Firefly-Inspired Algorithm for Job Shop Scheduling
• Job shop scheduling with unit length tasks
• Job shop scheduling with unit processing times
• scientific article; zbMATH DE number 1775452 (Why is no real title available?)

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 Q4448359)