scientific article; zbMATH DE number 432815

MaRDI QIDQ3138949zbMATHFDO

Authors David B. Shmoys, Clifford Stein, Joel Wein

Publication date 20 October 1993

zbMATH Keywords

job shop scheduling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited in

(10)

• Sevast'yanov's algorithm for the flow-shop scheduling problem
• On-line resource management with applications to routing and scheduling
• New results in the worst-case analysis for flow-shop scheduling
• An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times
• An iterative improvement approach for the nonpreemptive open shop scheduling problem
• Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
• Worst-case analysis of heuristics for open shops with parallel machines
• A hybrid genetic algorithm for the open shop scheduling problem
• The impact of local policies on the quality of packet routing in paths, trees, and rings
• Task scheduling in networks

Describes a project that uses

Uses Software

• JOBSHOP

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138949)