Pages that link to "Item:Q1406686"

From MaRDI portal

← A new approximation algorithm for UET-scheduling with chain-type precedence constraints. (Q1406686)

Jump to:navigation, search

The following pages link to A new approximation algorithm for UET-scheduling with chain-type precedence constraints. (Q1406686):

Displaying 1 item.

On scheduling cycle shops: Classification, complexity and approximation (Q1600002) (← links)

Retrieved from "https://portal.mardi4nfdi.de/wiki/Special:WhatLinksHere"