A fast feasibility test for relocation problems

DOI10.1016/0377-2217(88)90030-6zbMath0638.90057WikidataQ59558639 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 problem; redeveloping housing projects; relocation model

Mathematics Subject Classification ID

90C90: Applications of mathematical programming

90B35: Deterministic scheduling theory in operations research

90C27: Combinatorial optimization

Related Items

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

Cites Work

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