scientific article; zbMATH DE number 3941251

MaRDI QIDQ3713848zbMATH OpenFDO

Authors Sergey Sevastyanov

Publication date 1984

zbMATH Keywords

job shop schedulingminimum lengthworst case behavior of approximation algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Heuristics for short route job shop scheduling problems
• Job shop scheduling with alternative machines
• Optimal job-shop scheduling with two jobs in systems with unrestricted paths
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Short Shop Schedules

Cited in

(6)

• Heuristics for short route job shop scheduling problems
• On some geometric methods in scheduling theory: A survey
• Job-shop scheduling in a body shop
• Scheduling in network flow shops
• Bounding algorithm for the routing problem with arbitrary paths and alternative servers
• Scheduling jobshops with some identical or similar jobs

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