scientific article; zbMATH DE number 6472637

From MaRDI portal

Revision as of 03:07, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)

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

Publication:5501839

Jump to:navigation, search

zbMath1321.68503MaRDI QIDQ5501839

Leslie Ann Goldberg, Elizabeth Sweedyk, Aravind Srinivasan, Mike S. Paterson

Publication date: 14 August 2015

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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (5)

Solving the job-shop scheduling problem optimally by dynamic programming ⋮ Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem ⋮ Polynomial time approximation algorithms for machine scheduling: Ten open problems ⋮ On-line and off-line preemptive two-machine job shop 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:5501839&oldid=30059867"