Shortest common superstrings and scheduling with coordinated starting times

DOI10.1016/S0304-3975(97)00133-3zbMath0895.68009MaRDI QIDQ1127327

Martin Middendorf

Publication date: 13 August 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

NP-completenessjob-shopsuperstringsflow-shopshortest common superstring problem

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

Recognition of overlap graphs ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem

Cites Work

• Unnamed Item
• Unnamed Item
• On finding minimal length superstrings
• More on the complexity of common superstring and supersequence problems
• Optimal two- and three-stage production schedules with setup times included
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem

This page was built for publication: Shortest common superstrings and scheduling with coordinated starting times