scientific article; zbMATH DE number 1979499

zbMath1019.90020MaRDI QIDQ4425954

Hiroshi Nagamochi, Yoshiyuki Karuno

Publication date: 14 September 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2518/25180199.htm

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

Mathematics Subject Classification ID

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

Related Items (1)

Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures

This page was built for publication: