Generating the best \(K\) sequences in relocation problems

DOI10.1016/0377-2217(93)90098-8zbMath0792.90037OpenAlexW1979500280MaRDI QIDQ1309945

Bertrand M. T. Lin, Shian-Shyong Tseng

Publication date: 20 December 1993

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

Full work available at URL: https://doi.org/10.1016/0377-2217(93)90098-8

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

On the relocation problem with a second working crew for resource recycling ⋮ Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling subject to resource constraints: Classification and complexity
• A fast feasibility test for relocation problems
• New trends in machine scheduling
• Optimal two- and three-stage production schedules with setup times included
• Relocation problems are hard
• Some results of the relocation problems with processing times and deadlines
• Relocation problems of maximizing new capacities under a common due date
• Selecting the Kth Element in $X + Y$ and $X_1 + X_2 + \cdots + X_m $
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem

This page was built for publication: Generating the best \(K\) sequences in relocation problems