A fast feasibility test for relocation problems

DOI10.1016/0377-2217(88)90030-6MaRDI QIDQ1099778zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Recommendations

• On relocation problems with multiple identical working crews
• Some results of the relocation problems with processing times and deadlines
• Relocation scheduling subject to fixed processing sequences
• On the relocation problem with a second working crew for resource recycling
• Relocation-promotion problem with Euclidean distance

Cites work

• scientific article; zbMATH DE number 3449757 (Why is no real title available?)
• Optimal two- and three-stage production schedules with set-up time included

Cited in

(16)

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

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

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