scientific article; zbMATH DE number 4170628

zbMATH Open0711.90041MaRDI QIDQ3496142FDOQ3496142

Valerii A. Aksenov

Publication date: 1988

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

Recommendations

• scientific article; zbMATH DE number 3974707
• scientific article; zbMATH DE number 3970499
• Approximation algorithms for scheduling unrelated parallel machines
• An algorithm for the solution of the two-route Johnson problem
• A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem

zbMATH Keywords

polynomial complexity

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (27)

• A Fully Polynomial Approximation Scheme for Single-Product Scheduling in a Finite Capacity Facility
• On polynomial-time approximation algorithms for the variable length scheduling problem.
• Title not available (Why is that?)
• Title not available (Why is that?)
• How good is a dense shop schedule?
• A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays
• Polynomial algorithms for single machine scheduling problems with financial constraints
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• A modification of Hochbaum and Shmoys' algorithm for scheduling problems
• An iterative improvement approach for the nonpreemptive open shop scheduling problem
• Three-machine open shop with a bottleneck machine revisited
• Polynomial time algorithm for minmax scheduling with common due-window and proportional-linear shortening processing times
• Scheduling problems for parallel dedicated machines under multiple resource constraints.
• Dense open-shop schedules with release times
• Two-stage open shop scheduling with a bottleneck machine
• Worst-case analysis of heuristics for open shops with parallel machines
• Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks
• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• Title not available (Why is that?)
• The Open Shop Scheduling Problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• A hybrid genetic algorithm for the open shop scheduling problem

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