Bin packing and multiprocessor scheduling problems with side constraint on job types

DOI10.1016/0166-218X(83)90071-9zbMath0509.68028MaRDI QIDQ1838290

I. Morihara, Toshihide Ibaraki, Toshiharu Hasegawa

Publication date: 1983

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

multiprocessor schedulingapproximation algorithmsbin packing

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Same‐day deliveries in omnichannel retail: Integrated order picking and vehicle routing with vehicle‐site dependencies

Cites Work

• Unnamed Item
• Unnamed Item
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• An Application of Bin-Packing to Multiprocessor Scheduling

This page was built for publication: Bin packing and multiprocessor scheduling problems with side constraint on job types