Results 201 to 210 of about 4,494 (215)

Stochastic limit laws for schedule makespans

Communications in Statistics. Stochastic Models, 1996
Summary: A basic multiprocessor version of the makespan scheduling problem requires that \(n\) tasks be scheduled on \(m\) identical processors so as to minimize the latest task finishing time. In the standard probability model considered here, the task durations are i.i.d. random variables with a general distribution \(F\) having finite mean. Our main
Ward Whitt, Leopold Flatto, Edward G. Coffman   +2 more
openaire   +3 more sources

Stochastically minimizing the makespan in flow shops [PDF]

Naval Research Logistics Quarterly, 1984
AbstractIn this article, we are concerned with scheduling stochastic jobs in a flowshop with m machines and zero intermediate storage. We assume that there are n ‐ 2 identically distributed and 2 fast stochastic jobs. Roughly, the main result states that the makespan is stochastically minimized by placing one of the fast jobs first and the other last.
Robert D. Foley, S. Suresh
openaire   +2 more sources

Minimization of Makespan Quantiles

2011
In this chapter, we consider temporal networks whose task durations are functions of a resource allocation that can be chosen by the decision maker. The goal is to find a feasible resource allocation that minimizes the network’s makespan. We focus on non-renewable resources, that is, the resources are not replenished, and specified resource budgets ...
openaire   +2 more sources

Concurrent flowshop scheduling to minimize makespan

European Journal of Operational Research, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christos Koulamas, George J. Kyparisis
openaire   +2 more sources

Scheduling with Rejection to Minimize the Makespan

2009
In this paper, we consider the scheduling with rejection. The objective functions are to minimize the maximum completion time of the processed ones when the total compression cost is given. Firstly, we prove that the problem 1|rej | C max /TCP is NP-hard, which implying that P m |rej | C max /TCP , 1 |rej , r j |C max /TCP , 1 |rej , on *** line |C max
Yuzhong Zhang, Chengfei Wang, Jianfeng Ren   +2 more
openaire   +2 more sources

Remarks on the makespan minimization problem

Computers & Industrial Engineering, 1984
Abstract In this brief article we consider the worst-case performance of a heuristic proposed for the problem of minimizing the overall completion time in scheduling a collection of independent tasks to a system of identical processors. It has been suggested that this heuristic, based on the familiar LPTrule, possesses a vastly improved worst-case ...
openaire   +2 more sources

Minimization of the Worst-Case Makespan [PDF]

, 2011
In this chapter we study a robust resource allocation problem that minimizes the worst-case makespan. As in the previous chapters, we assume that the resource allocation is a here-and-now decision, whereas the task start times are modeled as a wait-and-see decision that may depend on random parameters affecting the task durations. In the terminology of
openaire   +1 more source

Minimizing Makespan on Identical Parallel Machines

International Journal of Operations Research and Information Systems, 2015
A heuristic algorithm that uses iteratively LPT and MF approaches on different job and machine sets constructed by using the current solution is developed to solve a classical multiprocessor scheduling problem with the objective of minimizing the makespan.
Kuruvilla A, PALETTA, Giuseppe
openaire   +2 more sources

Scheduling strategies for the bicriteria optimization of the robustness and makespan

2008 IEEE International Symposium on Parallel and Distributed Processing, 2008
In this paper we study the problem of scheduling a stochastic task graph with the objective of minimizing the makespan and maximizing the robustness. As these two metrics are not equivalent, we need a bicriteria approach to solve this problem. Moreover, as computing these two criteria is very time consuming we propose different approaches: from an ...
Canon, Louis-Claude, Jeannot, Emmanuel
openaire   +3 more sources

A general lower bound for the makespan problem

European Journal of Operational Research, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources