Solving a class of two-resource allocation problem by equivalent load method

DOI10.1057/PALGRAVE.JORS.2600387MaRDI QIDQ4356673zbMATH OpenOpenAlexFDO

Authors

Publication date 22 June 1998

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/palgrave.jors.2600387

zbMATH Keywords

efficient algorithmseries-parallel graphsequivalent load methodtwo-resource allocation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)

Recommendations

• An Algorithm for the Equipollent Resource Allocation Problem
• scientific article; zbMATH DE number 4008097
• scientific article; zbMATH DE number 4130178
• On a kind of optimal resource allocation problem with application
• Methods and algorithms for solving the resource allocation problem
• A Two-Resource Allocation Problem Solvable in Linear Time
• A new approximation technique for resource-allocation problems
• On a Reduction for a Class of Resource Allocation Problems
• Exact methods for the resource levelling problem
• scientific article; zbMATH DE number 3852784

Cited in

(14)

• A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
• Allocation of jobs and identical resources with two pooling centers
• A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates
• A unified approach for scheduling with convex resource consumption functions using positional penalties
• Parallel machine scheduling with a convex resource consumption function
• Minimizing the total weighted flow time in a single machine with controllable processing times
• Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times
• Just-in-time scheduling with controllable processing times on parallel machines
• The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
• A survey of scheduling with controllable processing times
• Single machine batch scheduling to minimize total completion time and resource consumption costs
• Convex resource allocation for minimizing the makespan in a single machine with job release dates
• Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
• scientific article; zbMATH DE number 6672347 (Why is no real title available?)

This page was built for publication: Solving a class of two-resource allocation problem by equivalent load method

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