Linear time approximation scheme for the multiprocessor open shop problem

Autor:	Gerhard J. Woeginger, Sergey V. Sevastianov
Přispěvatelé:	Discrete Mathematics and Mathematical Programming
Jazyk:	angličtina
Rok vydání:	2001
Předmět:	Approximation scheme Job shop scheduling Scheduling Applied Mathematics Approximation algorithm Multiprocessing Scheduling (computing) Running time Combinatorics Discrete Mathematics and Combinatorics Open shop Greedy algorithm Time complexity Mathematics
Zdroj:	Discrete applied mathematics, 114, 273-288. Elsevier Discrete Applied Mathematics, 114(1-3), 273-288. Elsevier
ISSN:	0166-218X
Popis:	For the r-stage open shop problem with identical parallel machines at each stage and the minimum makespan criterion, an approximation scheme is constructed with running time O(nrm+C(m,e)), where n is the number of jobs, m is the total number of machines, and C(m,e) is a function independent of n.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fc056014ae72d8d536edda1e9374948f https://research.tue.nl/en/publications/cf972d5c-8a30-43a2-8799-d3b7f9139bb6 Zobrazit plný text záznamu Full Text from ScienceDirect