Improved 0/1-interchange scheduling

DOI10.1007/BF01934441zbMath0494.68040MaRDI QIDQ1169295

Michael A. Langston

Publication date: 1982

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

multiprocessor schedulingworst-case performanceworst-case analysisapproximation algorithmsidentical processors22, 282-290 (1982)

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (6)

Partial solutions and multifit algorithm for multiprocessor scheduling ⋮ Performance analysis of the \((1+1)\) evolutionary algorithm for the multiprocessor scheduling problem ⋮ A composite algorithm for multiprocessor scheduling ⋮ Minimizing labor requirements in a periodic vehicle loading problem ⋮ Machine scheduling models in environmentally focused chemical manufacturing ⋮ A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective

Cites Work

• Unnamed Item
• A linear time approximation algorithm for multiprocessor scheduling
• An Application of Bin-Packing to Multiprocessor Scheduling
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: Improved 0/1-interchange scheduling