Scheduling under a Non-renewable Resource Constraint
From MaRDI portal
Publication:3983497
DOI10.1057/jors.1991.152zbMath0737.90036MaRDI QIDQ3983497
Aysegül Toker, Nesim Erkip, Suna Kondakci
Publication date: 27 June 1992
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1991.152
90B35: Deterministic scheduling theory in operations research
Related Items
On single machine scheduling with resource constraint, A multivariate complexity analysis of the material consumption scheduling problem, Approximability of scheduling problems with resource consuming jobs, Approximation schemes for single machine scheduling with non-renewable resource constraints, Reductions between scheduling problems with non-renewable resources and knapsack problems, Single machine scheduling problems with financial resource constraints: some complexity results and properties, Polynomial algorithms for single machine scheduling problems with financial constraints, Resource constrained scheduling simulation model for alternative stochastic network projects., Approximation schemes for parallel machine scheduling with non-renewable resources, A PTAS for a resource scheduling problem with arbitrary number of parallel machines, New complexity and approximability results for minimizing the total weighted completion time on a single machine subject to non-renewable resource constraints, Minimizing makespan on a single machine with release dates and inventory constraints, Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints, Bi-objective optimization algorithms for joint production and maintenance scheduling under a global resource constraint: application to the permutation flow shop problem
