scientific article

From MaRDI portal

Publication:3481474

Jump to:navigation, search

zbMATH Open0702.90040MaRDI QIDQ3481474

Adam Janiak

Publication date: 1988

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

zbMATH Keywords

maximum completion time polynomial-time algorithms maximum lateness maximum tardiness maximum cost nonrenewable resource Precedence constraints single machine sequencing allocation of continuously-divisible

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

An improved precedence rule for single machine sequencing problems with quadratic penalty

This page was built for publication:

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