scientific article

From MaRDI portal

Revision as of 10:39, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

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

Publication:3737196

Jump to:navigation, search

zbMath0601.90082MaRDI QIDQ3737196

Timkovsky, Vadim G.

Publication date: 1985

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

zbMATH Keywords

time complexity maximum completion time space complexity two-machine job-shop problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items (4)

A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem ⋮ Efficient algorithms for flexible job shop scheduling with parallel machines ⋮ Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem ⋮ Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems

This page was built for publication:

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