Solving a permutation problem by a fully polynomial-time approximation scheme

DOI10.7151/DMDICO.1119zbMath1225.90105OpenAlexW2324794414MaRDI QIDQ3000079

Wiesław Kurc, Stanisław Gawiejnowicz, Lidia Pankowska

Publication date: 18 May 2011

Published in: Discussiones Mathematicae. Differential Inclusions, Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/4d241f5af77fdfee7ef10de89672a91767562c2b

zbMATH Keywords

combinatorial optimizationpolynomial-time approximation schemediscrete control theory

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Linear optimal control problems (49N05)

Related Items (1)

Partial dominated schedules and minimizing the total completion time of deteriorating jobs

This page was built for publication: Solving a permutation problem by a fully polynomial-time approximation scheme