scientific article; zbMATH DE number 1560345

MaRDI QIDQ4527196zbMATH OpenFDO

Authors Roberto Solis-Oba, Maxim Sviridenko, Klaus Jansen

Publication date 1 February 2001

zbMATH Keywords

linear time approximation schemesshop scheduling problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 1418275
• Makespan Minimization in Job Shops: A Linear Time Approximation Scheme
• scientific article; zbMATH DE number 1512677
• APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS
• Makespan minimization in job shops: a polynomial time approximation scheme

Cited in

(6)

• No-wait shop scheduling: Computational complexity and approximate algorithms
• A linear programming-based method for job shop scheduling
• Makespan Minimization in Job Shops: A Linear Time Approximation Scheme
• scientific article; zbMATH DE number 1418275 (Why is no real title available?)
• Linear approximation of execution-time constraints
• Grouping techniques for scheduling problems: simpler and faster

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