scientific article
From MaRDI portal
Publication:3138949
zbMath0800.68222MaRDI QIDQ3138949
David B. Shmoys, Joel M. Wein, Clifford Stein
Publication date: 20 October 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (10)
Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps ⋮ The impact of local policies on the quality of packet routing in paths, trees, and rings ⋮ Task scheduling in networks ⋮ On-line resource management with applications to routing and scheduling ⋮ New results in the worst-case analysis for flow-shop scheduling ⋮ An iterative improvement approach for the nonpreemptive open shop scheduling problem ⋮ Sevast'yanov's algorithm for the flow-shop scheduling problem ⋮ A hybrid genetic algorithm for the open shop scheduling problem ⋮ An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times ⋮ Worst-case analysis of heuristics for open shops with parallel machines
Uses Software
This page was built for publication:
