Comparing the minimum completion times of two longest-first scheduling-heuristics

DOI10.1007/s10100-011-0217-4zbMath1339.90155OpenAlexW1984384174MaRDI QIDQ300962

Rico Walter

Publication date: 29 June 2016

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://www.db-thueringen.de/servlets/MCRFileNodeServlet/dbt_derivate_00022406/wp-jbe201013-1.pdf

zbMATH Keywords

heuristicsschedulingworst-case analysisidentical parallel machinesminimum completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)

Related Items (3)

A fast and effective subset sum based improvement procedure for workload balancing on identical parallel machines ⋮ Reducing ergonomic risks by job rotation scheduling ⋮ Improved approaches to the exact solution of the machine covering problem

Cites Work

• A performance guarantee for the greedy set-partitioning algorithm
• Maximizing the minimum completion time on parallel machines
• The exact LPT-bound for maximizing the minimum completion time
• Algorithms minimizing mean flow time: Schedule-length properties
• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• Ordinal on-line scheduling for maximizing the minimum machine completion time
• Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
• Analysis of Greedy Solutions for a Replacement Part Sequencing Problem
• Asymptotic Analysis of an Algorithm for Balanced Parallel Processor Scheduling
• On-line machine covering

This page was built for publication: Comparing the minimum completion times of two longest-first scheduling-heuristics