Generating the best K sequences in relocation problems
From MaRDI portal
Generating the best \(K\) sequences in relocation problems
Recommendations
- Some results of the relocation problems with processing times and deadlines
- Minimizing the total weighted completion time in the relocation problem
- Relocation scheduling subject to fixed processing sequences
- ON FINDING THE MOST VITAL JOB IN RELOCATION PROBLEM
- An FPTAS for two performance measures for the relocation scheduling problem subject to fixed processing sequences
Cites work
- A fast feasibility test for relocation problems
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
- scientific article; zbMATH DE number 3539163 (Why is no real title available?)
- scientific article; zbMATH DE number 544186 (Why is no real title available?)
- scientific article; zbMATH DE number 3449757 (Why is no real title available?)
- New trends in machine scheduling
- Optimal two- and three-stage production schedules with set-up time included
- Relocation problems are hard
- Relocation problems of maximizing new capacities under a common due date
- Scheduling subject to resource constraints: Classification and complexity
- Selecting the Kth Element in $X + Y$ and $X_1 + X_2 + \cdots + X_m $
- Some results of the relocation problems with processing times and deadlines
Cited in
(3)
This page was built for publication: Generating the best \(K\) sequences in relocation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1309945)
