Just-in-time scheduling with controllable processing times on parallel machines

Leyvand, Yaron; Shabtay, Dvir; Steiner, George; Yedidsion, Liron

doi:10.1007/s10878-009-9270-5

Cited by 25 publications

(9 citation statements)

References 42 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Algorithms of time complexities O(n log n) and O(n 2 m) are proposed by Lann and Mosheiov (2003) and Hiraishi et al (2002) for the case of equal-weight jobs and for the general case, respectively. The latter result is generalized further to the case of controllable processing times (Leyvand et al 2010), where a job consuming x j amount of resources gets a compressed processing time given by an arbitrary decreasing function p j (x j ); the associated resource consumption cost is linear,…”

Section: Related Workmentioning

confidence: 98%

“…As demonstrated in Leyvand et al (2010), the counterpart of problem + with fixed completion times can be solved in O(mn 2 ) time, while the counterparts of problems 1 and 2 are NP-hard. For discrete versions of NP-hard problems, Leyvand et al (2010) develop algorithms of time complexity O(mn m+1 X max ), where X max is the maximum resource usage cost, X max = n j=1 β contr j max x j , assuming that resource amounts x j are allowed to take only discrete values from a given range.…”

Section: Related Workmentioning

confidence: 99%

“…For discrete versions of NP-hard problems, Leyvand et al (2010) develop algorithms of time complexity O(mn m+1 X max ), where X max is the maximum resource usage cost, X max = n j=1 β contr j max x j , assuming that resource amounts x j are allowed to take only discrete values from a given range.…”

Section: Related Workmentioning

confidence: 99%

“…. , M m that minimizes the sum of the total cost F and total energy G. Adapting the ideas from the work by Hiraishi et al (2002) and Leyvand et al (2010), we reduce our problem to a minimum-cost flow problem in a special network (Fig. 1).…”

Section: Problem + On Parallel Machinesmentioning

confidence: 99%

See 3 more Smart Citations

Models and algorithms for energy-efficient scheduling with immediate start of jobs

Shioura

Shakhlevich

Strusevich

et al. 2017

J Sched

View full text Add to dashboard Cite

We study a scheduling model with speed scaling for machines and the immediate start requirement for jobs. Speed scaling improves the system performance, but incurs the energy cost. The immediate start condition implies that each job should be started exactly at its release time. Such a condition is typical for modern Cloud computing systems with abundant resources. We consider two cost functions, one that represents the quality of service and the other that corresponds to the cost of running. We demonstrate that the basic scheduling model to minimize the aggregated cost function with n jobs is solvable in O(n log n) time in the singlemachine case and in O(n 2 m) time in the case of m parallel machines. We also address additional features, e.g., the cost of job rejection or the cost of initiating a machine. In the case of a single machine, we present algorithms for minimizing one of the cost functions subject to an upper bound on the value of the other, as well as for finding a Pareto-optimal solution.

show abstract

Section: Related Workmentioning

confidence: 98%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Problem + On Parallel Machinesmentioning

confidence: 99%

See 2 more Smart Citations

Models and algorithms for energy-efficient scheduling with immediate start of jobs

Shioura

Shakhlevich

Strusevich

et al. 2017

J Sched

View full text Add to dashboard Cite

show abstract

“…In various real-life systems, however, processing times may be controllable by allocating resources, such as additional money, overtime, energy, fuel, catalysts, subcontracting, or additional manpower, to the job operations (see, e.g., [22,53,29,50]). Due to the large variety of applications, there is extensive literature on the subject of scheduling with controllable processing times (see, e.g., [55,21,20,23,24,2,8,57,19,37,51,46,14,15,49,59,33]). A survey of results up to 1990 is provided by Nowicki and Zdrzalka [38], and more recent surveys are presented by Chudzik et al [10], Janiak et al [26] and Shabtay and Steiner [48].…”

Section: Some Important Scheduling Problems Which Are Equivalent To Rmentioning

confidence: 99%

Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling

Yedidsion

Shabtay

Kaspi

2011

Discrete Applied Mathematics

Self Cite

View full text Add to dashboard Cite

a b s t r a c tWe extend the classical linear assignment problem to the case where the cost of assigning agent j to task i is a multiplication of task i's cost parameter by a cost function of agent j. The cost function of agent j is a linear function of the amount of resource allocated to the agent. A solution for our assignment problem is defined by the assignment of agents to tasks and by a resource allocation to each agent. The quality of a solution is measured by two criteria. The first criterion is the total assignment cost and the second is the total weighted resource consumption. We address these criteria via four different problem variations. We prove that our assignment problem is N P -hard for three of the four variations, even if all the resource consumption weights are equal. However, and somewhat surprisingly, we find that the fourth variation is solvable in polynomial time. In addition, we find that our assignment problem is equivalent to a large set of important scheduling problems whose complexity has been an open question until now, for three of the four variations.

show abstract

Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey

Shabtay

Steiner

2011

Just-in-Time Systems

View full text Add to dashboard Cite

Just-in-time scheduling with controllable processing times on parallel machines

Cited by 25 publications

References 42 publications

Models and algorithms for energy-efficient scheduling with immediate start of jobs

Models and algorithms for energy-efficient scheduling with immediate start of jobs

Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling

Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey

Contact Info

Product

Resources

About