scholarly journals Optimal resource cost for error mitigation

2021 ◽  
Vol 3 (3) ◽  
Author(s):  
Ryuji Takagi
Keyword(s):  
Error Mitigation ◽  
Optimal Resource ◽  
Resource Cost

SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE

2012 ◽  
Vol 29 (05) ◽  
pp. 1250030 ◽  
Author(s):  
JI-BO WANG ◽  
MING-ZHENG WANG ◽  
PING JI
Keyword(s):  
Resource Allocation ◽  
Cost Function ◽  
Waiting Times ◽  
Single Machine Scheduling ◽  
Optimal Sequence ◽  
Starting Time ◽  
Processing Times ◽  
Optimal Resource ◽  
Resource Cost ◽  
Total Resource

We consider single-machine scheduling problem in which the processing time of a job is a function of its position in a sequence, its starting time, and its resource allocation. The objective is to find the optimal sequence of jobs and the optimal resource allocation separately. We concentrate on two goals separately, namely, minimizing a cost function containing makespan, total completion time, total absolute differences in completion times, and total resource cost; minimizing a cost function containing makespan, total waiting time, total absolute differences in waiting times, and total resource cost. The problem is modeled as an assignment problem, and thus can be solved in polynomial time. Some extensions of the problem are also shown.

scholarly journals Analysis of the Optimal Resource Allocation for a Tandem Queueing System

2017 ◽  
Vol 2017 ◽  
pp. 1-10 ◽  
Author(s):  
Zaiming Liu ◽  
Wei Deng ◽  
Gang Chen
Keyword(s):  
Optimal Policy ◽  
Optimal Allocation ◽  
Queueing System ◽  
Service Rate ◽  
Allocation Policy ◽  
Long Run ◽  
Markov Decision ◽  
Upstream Station ◽  
Optimal Resource ◽  
Resource Cost

We study a controllable two-station tandem queueing system, where customers (jobs) must first be processed at upstream station and then the downstream station. A manager dynamically allocates the service resource to each station to adjust the service rate, leading to a tradeoff between the holding cost and resource cost. The goal of the manager is to find the optimal policy to minimize the long-run average costs. The problem is constructed as a Markov decision process (MDP). In this paper, we consider the model in which the resource cost and service rate functions are more general than linear. We derive the monotonicity of the optimal allocation policy by the quasiconvexity properties of the value function. Furthermore, we obtain the relationship between the two stations’ optimal policy and conditions under which the optimal policy is unique and has the bang-bang control property. Finally, we provide some numerical experiments to illustrate these results.

Scheduling to a Common Due Date on Unrelated Parallel-Machine with Deteriorating Jobs

2012 ◽  
Vol 605-607 ◽  
pp. 521-527 ◽  
Author(s):  
Chou Jung Hsu
Keyword(s):  
Resource Allocation ◽  
Deteriorating Jobs ◽  
Parallel Machine ◽  
Due Date ◽  
Optimal Resource Allocation ◽  
Common Due Date ◽  
Unrelated Machines ◽  
Optimal Resource ◽  
Resource Cost ◽  
The Cost

This paper explores scheduling to a common due date on unrelated machines with resource allocation and deteriorating jobs. The main purpose is to determine the optimal resource allocation and the optimal job sequence so that the cost function that includes the sum of earliness, tardiness, and resource cost will be minimized. Result showed that the problem is polynomial time solvable when the number of machine is fixed.

Sign in / Sign up

Export Citation Format

Share Document