scientific article; zbMATH DE number 3974707

MaRDI QIDQ3740554zbMATH OpenFDO

Authors S. A. Beletskij, V. Ts. Levental

Publication date 1985

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)

Recommendations

• scientific article; zbMATH DE number 4170628
• 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
• scientific article; zbMATH DE number 1670878

Cited in

(11)

• An experimental study of LP-based approximation algorithms for scheduling problems
• scientific article; zbMATH DE number 4010198 (Why is no real title available?)
• Parallel algorithms for solution of problems in scheduling theory
• scientific article; zbMATH DE number 7267489 (Why is no real title available?)
• A problem 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
• Sequential and parallel computations in the general scheduling problem
• Special issue: Efficient scheduling algorithms. 6 papers from ESA 2000 and APPROX 2000, both in Saarbrücken, Germany, September 5--8, 2000
• scientific article; zbMATH DE number 4170628 (Why is no real title available?)
• scientific article; zbMATH DE number 7529517 (Why is no real title available?)

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)