Minimizing the total weighted completion time in the relocation problem

DOI10.1007/S10951-009-0151-7MaRDI QIDQ964872zbMATH OpenOpenAlexFDO

Authors Alexander Kononov, B. M. T. Lin

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

zbMATH Keywords

approximation algorithmNP-hardnessrelocation problemresource-constrained scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)

Recommendations

• Minimizing the total weighted completion time for the relocation scheduling problems with precedence constraints
• Relocation scheduling subject to fixed processing sequences
• Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints
• Some results of the relocation problems with processing times and deadlines
• Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A fast feasibility test for relocation problems
• Combinatorial optimization. Theory and applications.
• On relocation problems with multiple identical working crews
• Optimal two- and three-stage production schedules with set-up time included
• Polynomial algorithms for single machine scheduling problems with financial constraints
• Relocation problems are hard
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Scheduling subject to resource constraints: Classification and complexity
• Tight complexity analysis of the relocation problem with arbitrary release dates

Cited in

(13)

• Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints
• Approximation algorithms for inventory constrained scheduling on a single machine
• Relocation scheduling subject to fixed processing sequences
• Quality of move-optimal schedules for minimizing total weighted completion time
• An FPTAS for two performance measures for the relocation scheduling problem subject to fixed processing sequences
• Approximating the optimal sequence of acquisitions and sales with a capped budget
• Minimizing the total weighted completion time for the relocation scheduling problems with precedence constraints
• On relocation problems with multiple identical working crews
• Resource-constrained flowshop scheduling with separate resource recycling operations
• An FPTAS of minimizing total weighted completion time on single machine with position constraint
• 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

This page was built for publication: Minimizing the total weighted completion time in the relocation problem

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