scientific article
From MaRDI portal
Publication:3496142
zbMath0711.90041MaRDI QIDQ3496142
Publication date: 1988
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items
Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ The Open Shop Scheduling Problem ⋮ Scheduling problems for parallel dedicated machines under multiple resource constraints. ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Dense open-shop schedules with release times ⋮ How good is a dense shop schedule? ⋮ An iterative improvement approach for the nonpreemptive open shop scheduling problem ⋮ Three-machine open shop with a bottleneck machine revisited ⋮ A hybrid genetic algorithm for the open shop scheduling problem ⋮ Two-stage open shop scheduling with a bottleneck machine ⋮ Worst-case analysis of heuristics for open shops with parallel machines
