Solving a class of two-resource allocation problem by equivalent load method
From MaRDI portal
Publication:4356673
DOI10.1057/palgrave.jors.2600387zbMath0890.90088MaRDI QIDQ4356673
No author found.
Publication date: 22 June 1998
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600387
90C35: Programming involving graphs or networks
90B35: Deterministic scheduling theory in operations research
Related Items
Single machine batch scheduling to minimize total completion time and resource consumption costs, The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times, Just-in-time scheduling with controllable processing times on parallel machines, A unified approach for scheduling with convex resource consumption functions using positional penalties, Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times, 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, Minimizing the total weighted flow time in a single machine with controllable processing times, A survey of scheduling with controllable processing times, A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates, A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates, Parallel machine scheduling with a convex resource consumption function
