scientific article; zbMATH DE number 2230249

zbMath1075.68560MaRDI QIDQ5708542

Jan van Leeuwen, Wil Michiels, Emile H. L. Aarts, Jan H. M. Korst

Publication date: 18 November 2005

Full work available at URL: http://www.sciencedirect.com/science/journal/15710653

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

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 (1)

Variable neighborhood descent applied to multi-way number partitioning problem

Cites Work

• Unnamed Item
• On the exact upper bound for the Multifit processor scheduling algorithm
• The rate of convergence to optimality of the LPT rule
• A note on the average-case behavior of a simple differencing method for partitioning
• A complete anytime algorithm for number partitioning
• The modified differencing method for the set partitioning problem with cardinality constraints
• Easily searched encodings for number partitioning
• Problem space local search for number partitioning
• A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors
• Tighter Bounds for the Multifit Processor Scheduling Algorithm
• Worst-case analysis of the differencing method for the partition problem
• Asymptotic Analysis of an Algorithm for Balanced Parallel Processor Scheduling
• An Application of Bin-Packing to Multiprocessor Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• The Differencing Algorithm LDM for Partitioning: A Proof of a Conjecture of Karmarkar and Karp
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: