On an NP-hard sorting problem

MaRDI QIDQ5502905zbMATH OpenFDO

Authors Krzysztof Giaro

Publication date 12 January 2009

zbMATH Keywords

flexible manufacturing systemsNP-hardnesssorting problem

Mathematics Subject Classification ID

Searching and sorting (68P10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• scientific article; zbMATH DE number 1303563
• NP-completeness of some optimal sequencing problems with a given grouping of elements
• Block Sorting is Hard
• Block sorting: a characterization and some heuristics
• APPROXIMATE BLOCK SORTING

Cited in

(2)

• The Mayor's dilemma
• Sorting arrays by means of swaps

This page was built for publication: On an NP-hard sorting problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5502905)