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

scientific article

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

zbMath1050.90526MaRDI QIDQ2723565

No author found.

Publication date: 5 July 2001


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.


Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Stochastic scheduling theory in operations research (90B36)


Related Items (7)

Unrelated Machine Scheduling with Stochastic Processing Times ⋮ A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective ⋮ Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms ⋮ Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates ⋮ Resource-constrained project scheduling: Notation, classification, models, and methods ⋮ The power of \(\alpha\)-points in preemptive single machine scheduling. ⋮ Approximation algorithms for shop scheduling problems with minsum objective







This page was built for publication:

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