Scheduling with time-of-use costs
نویسندگان
چکیده
منابع مشابه
Investigation of the two-machine flow shop scheduling problem to minimize total energy costs with time-dependent energy prices
In this paper, the problem of two-machine flow shop scheduling to minimize total energy costs under time-of-use tariffs is investigated. As the objective function of this study is not a regular measure, allowing intentional idle-time can be advantageous. So this study considers two approaches, one for non-delay version of the problem and the other one for a situation when inserting intentional ...
متن کاملA Note on Scheduling Problems with Irregular Starting Time Costs
In [9], Maniezzo and Mingozzi study a project scheduling problem with irregular starting time costs. Starting from the assumption that its computational complexity status is open, they develop a branch-and-bound procedure, and identify special cases that are solv-able in polynomial time. In this note, we review three previously established, related results which show that the general problem is...
متن کاملOn project scheduling with irregular starting time costs
Maniezzo and Mingozzi (Operations Research Letters 25 (1999), pp. 175–182) study a project scheduling problem with irregular starting time costs. Starting from the assumption that its computational complexity status is open, they develop a branch-and-bound procedure and they identify special cases that are solvable in polynomial time. In this note, we present a collection of previously establis...
متن کاملSelf-scheduling of EV aggregators in Energy market based on Time-of-Use Pricing
This paper presents a new solution for the self-planning task of private EV aggregators to realize higher profits in distribution networks. Since the model is proposed from the EV aggregator's viewpoint, the corresponding effects of the aggregator's profit-seeking approach on the grid such as the power losses and voltage levels might be unknown or even negative. To address this issue, a commerc...
متن کاملPreemptive Scheduling with Position Costs
This paper is devoted to basic scheduling problems in which the scheduling cost of a job is not a function of its completion time. Instead, the cost is derived from the integration of a cost function over the time intervals on which the job is processed. This criterion is specially meaningful when job preemption is allowed. Polynomial algorithms are presented to solve some special cases includi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2019
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2018.11.002