On polynomial solvability of two multiprocessor scheduling problems

zbMath0972.90030MaRDI QIDQ1806278

Eberhard Girlich, Alexander G. Tarnowski

Publication date: 21 November 2001

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

zbMATH Keywords

multiprocessor schedulinggreedy algorithmpackingpallet loadingguillotine cutting stock

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Polynomial algorithms for guillotine cutting of a rectangle into small rectangles of two kinds ⋮ A polynomial algorithm for one problem of guillotine cutting

This page was built for publication: On polynomial solvability of two multiprocessor scheduling problems