scientific article; zbMATH DE number 894722

MaRDI QIDQ4882997zbMATH OpenFDO

Authors Svetlana A. Kravchenko, Yuri N. Sotskov

Publication date 1 July 1996

zbMATH Keywords

makespantwo machinesthree jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs
• Optimal Preemptive Scheduling of Two Unrelated Processors
• Scheduling three-operation jobs in a two-machine flow shop to minimize makespan
• Makespan minimization in preemptive two machine job shops

Cited in

(11)

• Two-machine job-shop scheduling with one joint job
• Complexity of shop-scheduling problems with fixed number of jobs: a survey
• Complexity of mixed shop scheduling problems: A survey
• Optimal job-shop scheduling with two jobs in systems with unrestricted paths
• On the complexity of two machine job-shop scheduling with regular objective functions
• A polynomial algorithm for the three-machine open shop with a bottleneck machine
• Scheduling three-operation jobs in a two-machine flow shop to minimize makespan
• Deterministic job-shop scheduling: Past, present and future
• scientific article; zbMATH DE number 781213 (Why is no real title available?)
• Mixed graph colouring as scheduling multi-processor tasks with equal processing times
• Three-machine shop scheduling with partially ordered processing routes

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