A fast feasibility test for relocation problems

DOI10.1016/0377-2217(88)90030-6zbMath0638.90057OpenAlexW2063626041WikidataQ59558639 ScholiaQ59558639MaRDI QIDQ1099778

Edward H. Kaplan, Amihood Amir

Publication date: 1988

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(88)90030-6

zbMATH Keywords

Johnson's scheduling problemredeveloping housing projectsrelocation model

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (14)

Flow shop non-idle scheduling and resource-constrained scheduling ⋮ Relocation scheduling subject to fixed processing sequences ⋮ Some results of the relocation problems with processing times and deadlines ⋮ On relocation problems with multiple identical working crews ⋮ Relocation problems of maximizing new capacities under a common due date ⋮ Tight complexity analysis of the relocation problem with arbitrary release dates ⋮ Minimizing the total weighted completion time in the relocation problem ⋮ Resource-constrained flowshop scheduling with separate resource recycling operations ⋮ The project scheduling problem with production and consumption of resources: a list-scheduling based algorithm ⋮ On the relocation problem with a second working crew for resource recycling ⋮ Johnson's rule, composite jobs and the relocation problem ⋮ Generating the best \(K\) sequences in relocation problems ⋮ Approximating the optimal sequence of acquisitions and sales with a capped budget ⋮ Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints

Cites Work

• Optimal two- and three-stage production schedules with setup times included
• Unnamed Item

This page was built for publication: A fast feasibility test for relocation problems