Linear time approximation scheme for the multiprocessor open shop problem
From MaRDI portal
Publication:5954097
DOI10.1016/S0166-218X(00)00375-9zbMath1020.68016MaRDI QIDQ5954097
Gerhard J. Woeginger, Sergey Sevast'janov
Publication date: 10 December 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68W25: Approximation algorithms
Related Items
Open-shop scheduling for unit jobs under precedence constraints, The three-machine proportionate open shop and mixed shop minimum makespan problems, Flexible open shop scheduling problem to minimize makespan, Scheduling open shops with parallel machines to minimize total completion time, A genetic algorithm for the proportionate multiprocessor open shop, Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop, Large-scale medical examination scheduling technology based on intelligent optimization, A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop, A linear time approximation scheme for makespan minimization in an open shop with release dates, Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches, A tabu search approach for proportionate multiprocessor open shop scheduling, Open block scheduling in optical communication networks, Some positive news on the proportionate open shop problem
Cites Work
