Linear time approximation scheme for the multiprocessor open shop problem

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)

zbMATH Keywords

schedulingopen shopapproximation scheme

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (13)

Some positive news on the proportionate open shop problem ⋮ The three-machine proportionate open shop and mixed shop minimum makespan problems ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ Flexible open shop scheduling problem to minimize makespan ⋮ Scheduling open shops with parallel machines to minimize total completion time ⋮ A tabu search approach for proportionate multiprocessor open shop scheduling ⋮ Large-scale medical examination scheduling technology based on intelligent optimization ⋮ Open block scheduling in optical communication networks ⋮ A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop ⋮ A genetic algorithm for the proportionate multiprocessor open shop ⋮ Open-shop scheduling for unit jobs under precedence constraints ⋮ Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop ⋮ A linear time approximation scheme for makespan minimization in an open shop with release dates

Cites Work

• Makespan minimization in open shops: A polynomial time approximation scheme
• Approximation algorithms for the multiprocessor open shop scheduling problem
• Short Shop Schedules
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Linear time approximation scheme for the multiprocessor open shop problem