scientific article; zbMATH DE number 1271637

From MaRDI portal

Revision as of 15:47, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4238767

Jump to:navigation, search

zbMath0940.90033MaRDI QIDQ4238767

Feng Zhang, Wanzhen Huang

Publication date: 30 March 1999

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

zbMATH Keywords

polynomial-time algorithm controllable processing times single-machine scheduling problems crash activities

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

A \(\frac 32\)-approximation algorithm for parallel machine scheduling with controllable processing times

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4238767&oldid=18123021"