scientific article; zbMATH DE number 1757967

MaRDI QIDQ4537755zbMATH OpenFDO

Authors Maurice Queyranne, Maxim Sviridenko

Publication date 20 June 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2081/20810361

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• A (2+ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective
• Approximation algorithms for shop scheduling problems with minsum objective
• scientific article; zbMATH DE number 1445389
• Open-shop scheduling for unit jobs under precedence constraints
• Minimizing the sum of weighted completion times in a concurrent open shop

Cited in

(5)

• Interval-indexed formulation based heuristics for single machine total weighted tardiness problem
• A greedy open shop heuristic with job priorities
• Approximation algorithms for shop scheduling problems with minsum objective
• Designing PTASs for MIN-SUM scheduling problems
• A (2+ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective

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