Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 1305545

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

zbMATH Open1052.90564MaRDI QIDQ4252437FDOQ4252437


Authors: Patchrawat Uthaisombut, Eric Torng Edit this on Wikidata


Publication date: 1999



Title of this publication is not available (Why is that?)




Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35)



Cited In (6)

  • Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time
  • Randomized algorithms for on-line scheduling problems: How low can't you go?
  • Designing PTASs for MIN-SUM scheduling problems
  • A new approach for bicriteria partitioning problem
  • Multicriteria scheduling
  • Bicriteria two-machine flowshop scheduling: approximation algorithms and their limits





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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4252437&oldid=18143044"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 6 February 2024, at 16:26. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki