A general lower bound for the makespan problem

DOI10.1016/0377-2217(94)00333-5zbMath0915.90154OpenAlexW2003959519MaRDI QIDQ1266724

S. T. Webster

Publication date: 7 October 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00333-5

zbMATH Keywords

makespanlower boundNP-hardidentical parallel processors

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Parallel numerical computation (65Y05)

Related Items (5)

Search tree based approaches for parallel machine scheduling ⋮ Operations research at container terminals: a literature update ⋮ Optimal parallel machines scheduling with availability constraints ⋮ Tight bounds for the identical parallel machine scheduling problem ⋮ Minimizing makespan on parallel machines subject to release dates and delivery times

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel machines scheduling with nonsimultaneous machine available time
• Multiprocessor scheduling: Combining LPT and MULTIFIT
• The Asymptotic Optimality of the LPT Rule
• New Bounds for the Identical Parallel Processor Weighted Flow Time Problem
• Algorithms for Scheduling Independent Tasks
• Scheduling independent tasks to reduce mean finishing time
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: A general lower bound for the makespan problem