scientific article

From MaRDI portal

Publication:3517651

Jump to:navigation, search

zbMath1145.90381MaRDI QIDQ3517651

Tanka Nath Dhamala

Publication date: 12 August 2008

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

zbMATH Keywords

computational complexity irreducibility counting problem potential optimality sequence decomposition shop scheduling problems

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan

This page was built for publication:

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