scientific article; zbMATH DE number 4170628
From MaRDI portal
Publication:3496142
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
Cited in
(28)- Polynomially solvable subcases for the approximate solution of multi-machine scheduling problems
- 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.
- scientific article; zbMATH DE number 1560545 (Why is no real title available?)
- scientific article; zbMATH DE number 3987032 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 4108469 (Why is no real title available?)
- scientific article; zbMATH DE number 1731178 (Why is no real title available?)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
- scientific article; zbMATH DE number 3974707 (Why is no real title available?)
- 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
- The 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
- Worst-case analysis of heuristics for open shops with parallel machines
- Two-stage open shop scheduling with a bottleneck machine
- 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
- scientific article; zbMATH DE number 781227 (Why is no real title available?)
- scientific article; zbMATH DE number 4068591 (Why is no real title available?)
- A hybrid genetic algorithm for the open shop scheduling problem
- scientific article; zbMATH DE number 3970499 (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 Q3496142)
