Minimizing the total weighted completion time in the relocation problem
From MaRDI portal
Publication:964872
DOI10.1007/s10951-009-0151-7zbMath1184.90062OpenAlexW1983299988MaRDI QIDQ964872
Bertrand M. T. Lin, Alexander V. Kononov
Publication date: 21 April 2010
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-009-0151-7
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items
Relocation scheduling subject to fixed processing sequences ⋮ An FPTAS for two performance measures for the relocation scheduling problem subject to fixed processing sequences ⋮ Approximation algorithms for inventory constrained scheduling on a single machine ⋮ Tight complexity analysis of the relocation problem with arbitrary release dates ⋮ Resource-constrained flowshop scheduling with separate resource recycling operations ⋮ Approximating the optimal sequence of acquisitions and sales with a capped budget ⋮ An FPTAS of minimizing total weighted completion time on single machine with position constraint
Cites Work
- Unnamed Item
- Tight complexity analysis of the relocation problem with arbitrary release dates
- On relocation problems with multiple identical working crews
- Scheduling subject to resource constraints: Classification and complexity
- A fast feasibility test for relocation problems
- Polynomial algorithms for single machine scheduling problems with financial constraints
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Combinatorial optimization. Theory and applications.
- Optimal two- and three-stage production schedules with setup times included
- Relocation problems are hard
