scientific article

zbMATH Open0603.90072MaRDI QIDQ3740554FDOQ3740554

S. A. Beletskij, V. Ts. Levental

Publication date: 1985

Title of this publication is not available (Why is that?)

zbMATH Keywords

minimum lengthNP-hardapproximation polynomial-time algorithmparallel machines at each stagegeneral job shop scheduling

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cited In (7)

• An experimental study of LP-based approximation algorithms for scheduling problems
• Title not available (Why is that?)
• Parallel algorithms for solution of problems in scheduling theory
• A survey of methods for the solution of problems of scheduling theory
• Efficient algorithms for a scheduling problem and its applications to illicit drug market crackdowns
• Special issue: Efficient scheduling algorithms. 6 papers from ESA 2000 and APPROX 2000, both in Saarbrücken, Germany, September 5--8, 2000
• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• Approximate algorithms for the \(P\parallel C_{\max}\) problem 👍 👎
• An approximation algorithm for the generalized assignment problem 👍 👎
• Efficient algorithms for flexible job shop scheduling with parallel machines 👍 👎
• Title not available (Why is that?) 👍 👎

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 Q3740554)