scientific article; zbMATH DE number 3970499

MaRDI QIDQ3737196zbMATH OpenFDO

Authors Vadim G. Timkovsky

Publication date 1985

zbMATH Keywords

maximum completion timespace complexitytime complexitytwo-machine job-shop problem

Mathematics Subject Classification ID

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

Recommendations

• A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem
• A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs
• An efficient algorithm for the job-shop problem with two jobs
• scientific article; zbMATH DE number 4170628
• On the complexity of two machine job-shop scheduling with regular objective functions

Cited in

(10)

• Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
• A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem
• Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem
• A polynomially solvable case of the two-stage open shop problem for three machines
• scientific article; zbMATH DE number 1731178 (Why is no real title available?)
• scientific article; zbMATH DE number 3843474 (Why is no real title available?)
• scientific article; zbMATH DE number 3871006 (Why is no real title available?)
• scientific article; zbMATH DE number 4137518 (Why is no real title available?)
• scientific article; zbMATH DE number 4170628 (Why is no real title available?)
• Efficient algorithms for flexible job shop scheduling with parallel machines

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