On relocation problems with multiple identical working crews

DOI10.1016/J.DISOPT.2006.06.003MaRDI QIDQ865754zbMATH OpenOpenAlexFDO

Authors Alexander Kononov, B. M. T. Lin

Publication date 20 February 2007

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disopt.2006.06.003

zbMATH Keywords

approximationNP-hardnessparallel machinesresource constraintsjob schedulingpublic housing project

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Recommendations

• On the relocation problem with a second working crew for resource recycling
• Minimizing the total weighted completion time in the relocation problem
• Some results of the relocation problems with processing times and deadlines
• An FPTAS for two performance measures for the relocation scheduling problem subject to fixed processing sequences
• Relocation scheduling subject to fixed processing sequences

Cites work

• scientific article; zbMATH DE number 4095196 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A fast feasibility test for relocation problems
• Bin packing can be solved within 1+epsilon in linear time
• Discrete-variable extremum problems
• 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
• Scheduling subject to resource constraints: Classification and complexity

Cited in

(9)

• On the relocation problem with a second working crew for resource recycling
• Relocation scheduling subject to fixed processing sequences
• An FPTAS for two performance measures for the relocation scheduling problem subject to fixed processing sequences
• Johnson's rule, composite jobs and the relocation problem
• A fast feasibility test for relocation problems
• ON FINDING THE MOST VITAL JOB IN RELOCATION PROBLEM
• Resource-constrained flowshop scheduling with separate resource recycling operations
• Minimizing the total weighted completion time in the relocation problem
• Tight complexity analysis of the relocation problem with arbitrary release dates

This page was built for publication: On relocation problems with multiple identical working crews

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