Approximation algorithms for shop scheduling problems with minsum objective: A correction

DOI10.1007/S10951-006-8790-4MaRDI QIDQ880571zbMATH OpenOpenAlexFDO

Authors Wenhua Li, Maurice Queyranne, Jinjiang Yuan, Maxim Sviridenko

Publication date 15 May 2007

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10951-006-8790-4

zbMATH Keywords

Approximation algorithmsShop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Corrigendum: ``Improved results for data migration and open shop scheduling
• Corrigendum to: ``Solving the job-shop scheduling problem optimally by dynamic programming
• Approximation algorithms for shop scheduling problems with minsum objective
• scientific article; zbMATH DE number 1445389
• The job shop tardiness problem: A corrected model

Cites work

• Approximation algorithms for shop scheduling problems with minsum objective

Cited in

(5)

• Corrigendum to: ``Solving the job-shop scheduling problem optimally by dynamic programming
• Scheduling problems over a network of machines
• Scheduling problems over network of machines
• Corrigendum: ``Improved results for data migration and open shop scheduling
• Approximation Algorithms for Generalized Path Scheduling

This page was built for publication: Approximation algorithms for shop scheduling problems with minsum objective: A correction

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