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 …
A tight approximation ratio of a list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource
S Hashimoto, S Mizuno - Journal of Scheduling, 2021 - Springer
In this paper, we investigate an open problem by Györgyi and Kis for a single-machine
scheduling problem with a non-renewable resource (NR-SSP) and total weighted …
scheduling problem with a non-renewable resource (NR-SSP) and total weighted …
Single machine order acceptance scheduling with periodic energy consumption limits
M Bouzid, O Masmoudi, A Yalaoui - … 2021, Nantes, France, September 5–9 …, 2021 - Springer
This work presents an Order Acceptance Scheduling (OAS) problem with the introduction of
energy consumption limits at each period of the planning horizon. The objective is to …
energy consumption limits at each period of the planning horizon. The objective is to …
A 3-approximation list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource and total weighted completion time criterion
S Hashimoto, S Mizuno - … of the Operations Research Society of …, 2022 - jstage.jst.go.jp
This paper studies a single-machine scheduling problem with a non-renewable resource
(NR-SSP) and total weighted completion time criterion. The non-renewable resource is …
(NR-SSP) and total weighted completion time criterion. The non-renewable resource is …
Scheduling with non-renewable resources: minimizing the sum of completion times
We consider single-machine scheduling with a non-renewable resource. In this setting, we
are given a set of jobs, each characterized by a processing time, a weight, and a resource …
are given a set of jobs, each characterized by a processing time, a weight, and a resource …