On polynomial solvability of two multiprocessor scheduling problems

MaRDI QIDQ1806278zbMATH OpenFDO

Authors Eberhard Girlich, Alexander G. Tarnowski

Publication date 21 November 2001

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

zbMATH Keywords

greedy algorithmguillotine cutting stockmultiprocessor schedulingpackingpallet loading

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• On some polynomial solvable cases of cutting stock, pallet loading and scheduling problems
• Partial solutions and multifit algorithm for multiprocessor scheduling
• A polynomial time approximation scheme for general multiprocessor job scheduling
• Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems

Cited in

(8)

• A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs
• Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
• Polynomial algorithms for guillotine cutting of a rectangle into small rectangles of two kinds
• A polynomial algorithm for one problem of guillotine cutting
• Sub-polyhedral scheduling using (unit-)two-variable-per-inequality polyhedra
• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• scientific article; zbMATH DE number 67596 (Why is no real title available?)
• On some polynomial solvable cases of cutting stock, pallet loading and scheduling problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806278)