Approximation schemes for parallel machine scheduling with non-renewable resources
In this paper the approximability of parallel machine scheduling problems with resource
consuming jobs is studied. In these problems, in addition to a parallel machine environment …
consuming jobs is studied. In these problems, in addition to a parallel machine environment …
[HTML][HTML] Scheduling with jobs at fixed positions
F Jaehn - European Journal of Operational Research, 2024 - Elsevier
In this paper, we study classical single machine scheduling problems with the additional
constraint that a set of special jobs must be scheduled at certain positions in the job …
constraint that a set of special jobs must be scheduled at certain positions in the job …
Approximability of scheduling problems with resource consuming jobs
The paper presents new approximability results for single machine scheduling problems
with jobs requiring some non-renewable resources (like raw materials, energy, or money) …
with jobs requiring some non-renewable resources (like raw materials, energy, or money) …
Approximability of total weighted completion time with resource consuming jobs
T Kis - Operations Research Letters, 2015 - Elsevier
In this paper we study an extension of the single machine scheduling problem with the total
weighted completion time objective, where there is a single non-renewable resource …
weighted completion time objective, where there is a single non-renewable resource …
Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints
In this paper, we describe new complexity results and approximation algorithms for single-
machine scheduling problems with non-renewable resource constraints and the total …
machine scheduling problems with non-renewable resource constraints and the total …
Minimizing the maximum lateness on a single machine with raw material constraints by branch-and-cut
Abstract Machine scheduling with raw material constraints has a great practical potential, as
it is solved by ad hoc methods in practice in several manufacturing and logistic …
it is solved by ad hoc methods in practice in several manufacturing and logistic …
A PTAS for a resource scheduling problem with arbitrary number of parallel machines
P Györgyi - Operations Research Letters, 2017 - Elsevier
In this paper we study a parallel machine scheduling problem with non-renewable resource
constraints. That is, besides the jobs and machines, there is a common non-renewable …
constraints. That is, besides the jobs and machines, there is a common non-renewable …
A multivariate complexity analysis of the material consumption scheduling problem
The NP-hard problem Material Consumption Scheduling and related problems have been
thoroughly studied since the 1980's. Roughly speaking, the problem deals with scheduling …
thoroughly studied since the 1980's. Roughly speaking, the problem deals with scheduling …
Scheduling with non-renewable resources: Minimizing the sum of completion times
We consider single-machine scheduling problems with a non-renewable resource. In this
setting, there are n jobs, each characterized by a processing time, a weight, and a resource …
setting, there are n jobs, each characterized by a processing time, a weight, and a resource …
Worst-Case Analysis of Cash Inventory in Single Machine Scheduling
M Morady Gohareh, E Mansouri… - Scientia …, 2022 - scientiairanica.sharif.edu
This paper studies the inventory of cash as a renewable resource in single machine
scheduling problem. The status of cash is incorporated in to the objective function. Average …
scheduling problem. The status of cash is incorporated in to the objective function. Average …