Scheduling subject to nonrenewable-resource constraints

DOI10.1016/0167-6377(82)90045-1zbMath0494.90041OpenAlexW2054486362MaRDI QIDQ1169397

S. Singh

Publication date: 1982

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(82)90045-1

zbMATH Keywords

polynomial time algorithmprecedence constrained schedulingdepletion time dependant job costminimal makespanminimization of maximum costnonrenewable-resource constraints

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items (19)

Polynomial algorithms for single machine scheduling problems with financial constraints ⋮ Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem ⋮ Minimizing makespan on a single machine with release dates and inventory constraints ⋮ Approximation schemes for single machine scheduling with non-renewable resource constraints ⋮ Lower bounds for the event scheduling problem with consumption and production of resources ⋮ A multivariate complexity analysis of the material consumption scheduling problem ⋮ Approximation schemes for parallel machine scheduling with non-renewable resources ⋮ Scheduling of inventory releasing jobs to minimize a regular objective function of delivery times ⋮ A PTAS for a resource scheduling problem with arbitrary number of parallel machines ⋮ Reductions between scheduling problems with non-renewable resources and knapsack problems ⋮ Single machine scheduling problems with financial resource constraints: some complexity results and properties ⋮ EPTAS for load balancing problem on parallel machines with a non-renewable resource ⋮ Approximability of total weighted completion time with resource consuming jobs ⋮ On single machine scheduling with resource constraint ⋮ A tight approximation ratio of a list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource ⋮ EPTAS for load balancing problem on parallel machines with a non-renewable resource ⋮ Preemptive scheduling of independent jobs on parallel machines subject to financial constraints ⋮ Approximating the optimal sequence of acquisitions and sales with a capped budget ⋮ Approximability of scheduling problems with resource consuming jobs

Cites Work

• Multiobjective network scheduling with efficient use of renewable and nonrenewable resources
• On the computational power of pushdown automata
• Computational Complexity of Discrete Optimization Problems

This page was built for publication: Scheduling subject to nonrenewable-resource constraints