Relocation Problems are Hard

Amihood Amir; Edward H. Kaplan

doi:10.1080/00207168808803664

Relocation Problems are Hard

Amihood Amir
, Edward H. Kaplan

Research output: Contribution to journal › Article › peer-review

15 Scopus citations

Abstract

We show that General Relocation is NP-Complete. However, specific Relocation subproblems, such as relocation feasibility or Johnson's scheduling problem are shown to be of almost linear complexity. @1988 Gordon and Breach, Science Publishers. tnc.

Original language	English
Pages (from-to)	101-110
Number of pages	10
Journal	International Journal of Computer Mathematics
Volume	25
Issue number	2
DOIs	https://doi.org/10.1080/00207168808803664
State	Published - Jan 1988
Externally published	Yes

Keywords

NP-completeness
Relocation problems
polynomial reduction
scheduling problems

Access to Document

10.1080/00207168808803664

Cite this

@article{eb49019a184847a4afc59652fa998c62,

title = "Relocation Problems are Hard",

abstract = "We show that General Relocation is NP-Complete. However, specific Relocation subproblems, such as relocation feasibility or Johnson's scheduling problem are shown to be of almost linear complexity. @1988 Gordon and Breach, Science Publishers. tnc.",

keywords = "NP-completeness, Relocation problems, polynomial reduction, scheduling problems",

author = "Amihood Amir and Kaplan, \{Edward H.\}",

year = "1988",

month = jan,

doi = "10.1080/00207168808803664",

language = "אנגלית",

volume = "25",

pages = "101--110",

journal = "International Journal of Computer Mathematics",

issn = "0020-7160",

publisher = "Taylor and Francis Ltd.",

number = "2",

}

TY - JOUR

T1 - Relocation Problems are Hard

AU - Amir, Amihood

AU - Kaplan, Edward H.

PY - 1988/1

Y1 - 1988/1

N2 - We show that General Relocation is NP-Complete. However, specific Relocation subproblems, such as relocation feasibility or Johnson's scheduling problem are shown to be of almost linear complexity. @1988 Gordon and Breach, Science Publishers. tnc.

AB - We show that General Relocation is NP-Complete. However, specific Relocation subproblems, such as relocation feasibility or Johnson's scheduling problem are shown to be of almost linear complexity. @1988 Gordon and Breach, Science Publishers. tnc.

KW - NP-completeness

KW - Relocation problems

KW - polynomial reduction

KW - scheduling problems

UR - https://www.scopus.com/pages/publications/0344613902

U2 - 10.1080/00207168808803664

DO - 10.1080/00207168808803664

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0344613902

SN - 0020-7160

VL - 25

SP - 101

EP - 110

JO - International Journal of Computer Mathematics

JF - International Journal of Computer Mathematics

IS - 2

ER -

Relocation Problems are Hard

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this