Scheduling jobs to two machines subject to batch arrival ordering

DOI10.1002/NAV.3800260313zbMath0496.90043OpenAlexW2071656856MaRDI QIDQ3960455

Arie Tamir

Publication date: 1979

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800260313

zbMATH Keywords

computational experienceefficient algorithmbatch arrivalstwo processorsminimization of total flow timepredetermined partial orderingscheduling of n jobs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cites Work

• An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
• Scheduling independent tasks to reduce mean finishing time

This page was built for publication: Scheduling jobs to two machines subject to batch arrival ordering