Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

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

From MaRDI portal
Publication:880571
Jump to:navigation, search

DOI10.1007/s10951-006-8790-4zbMath1154.90469OpenAlexW2071226715MaRDI QIDQ880571

Wenhua Li, Jinjiang Yuan, Maurice Queyranne, M. I. 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)


Related Items (3)

Scheduling Problems over Network of Machines ⋮ Approximation Algorithms for Generalized Path Scheduling ⋮ Scheduling problems over a network of machines



Cites Work

  • Approximation algorithms for shop scheduling problems with minsum objective




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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:880571&oldid=12835518"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 15:49.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki