Results 1  10
of
140
Minimum Makespan Assembly Plans
 European Journal of Operational Research
, 1998
"... An important class of problems in manufacturing system are those in which there is an item to be produced, a set of components which can be assembled together in order to obtain the wanted item, and a set of machines which are capable to perform the assembly operations. Here we consider the case ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
in which one wants to find an optimal list of assembly operations. After discussing several optimality criteria, we address the problem in which the assembly operations are to be chosen in such a way that they can be scheduled on the available machines at minimum makespan. We show that these problems
The power of reordering for online minimum makespan scheduling
 In Proc. 49th FOCS
"... In the classic minimum makespan scheduling problem, we are given an input sequence of jobs with processing times. A scheduling algorithm has to assign the jobs to m parallel machines. The objective is to minimize the makespan, which is the time it takes until all jobs are processed. In this paper, w ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
In the classic minimum makespan scheduling problem, we are given an input sequence of jobs with processing times. A scheduling algorithm has to assign the jobs to m parallel machines. The objective is to minimize the makespan, which is the time it takes until all jobs are processed. In this paper
Minimum Makespan Scheduling with Low Rank Processing Times
, 2012
"... We investigate approximation algorithms for the classical minimum makespan scheduling problem, focusing on instances where the rank of the matrix describing the processing times of the jobs is bounded. A bounded rank matrix arises naturally when the processing time of a job on machine depends upon a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We investigate approximation algorithms for the classical minimum makespan scheduling problem, focusing on instances where the rank of the matrix describing the processing times of the jobs is bounded. A bounded rank matrix arises naturally when the processing time of a job on machine depends upon
Minimum Makespan Multivehicle DialaRide
"... Abstract. DialaRide problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as sourcedestination pairs {(si, ti)} m i=1, where each object requires to be moved from its source to destination vertex. In the multivehicl ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
to destinations. The objective is to find a feasible schedule that minimizes the maximum completion time (i.e. makespan) of vehicles, where the completion time of vehicle j is the time when it returns to its depot rj at the end of its route. We consider the preemptive version of multivehicle DialaRide, where
Minimum Makespan Multivehicle DialaRide *
"... Abstract DialaRide problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as sourcedestination pairs {( , where each object requires to be moved from its source to destination vertex. In the multivehicle DialaRide ..."
Abstract
 Add to MetaCart
to destinations. The objective is to find a feasible schedule that minimizes the maximum completion time (i.e. makespan) of vehicles, where the completion time of vehicle j is the time when it returns to its depot r j at the end of its route. We study the preemptive version of multivehicle DialaRide, where
Case Study on Statistically Estimating Minimum Makespan for Flow Line Scheduling Problems
 TO APPEAR, EUROPEAN JOURNAL OF OPERATIONAL RESEARCH.
"... Lower bounds are typically used to evaluate the performance of heuristics for solving combinatorial minimization problems. In the absence of tight analytical lower bounds, optimal objectivefunction values may be estimated statistically. In this paper, extreme value theory is used to construct confi ..."
Abstract
 Add to MetaCart
confidenceinterval estimates of the minimum makespan achievable when scheduling nonsimilar groups of jobs on a twostage flow line. Experimental results based on randomly sampled solutions to each of 180 randomly generated test problems revealed that (i) leastsquares parameter estimators outperformed
MultiExchange Algorithms for the Minimum Makespan Machine Scheduling Problem
, 1999
"... We address the problem of scheduling independent jobs to identical parallel machines in order to minimize the completion time (makespan). This is a hard problem, for which both constructive and improvement heuristics have been proposed. We describe new local search algorithms, whose neighborhood ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We address the problem of scheduling independent jobs to identical parallel machines in order to minimize the completion time (makespan). This is a hard problem, for which both constructive and improvement heuristics have been proposed. We describe new local search algorithms, whose neighborhood
A Tropical Optimization Problem with Application to Project Scheduling with Minimum Makespan
"... ar ..."
Minimum Makespan Workload Dissemination in DTNs: Making Full Utilization of Computational Surplus Around
"... This paper poses the following problem: given a task that originates at some node in a Delay Tolerant Network (DTN), how are we to disseminate the workload during pairwise contacts to minimize the makespan? We first investigate the scenario in which each node has access to an oracle that knows glob ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper poses the following problem: given a task that originates at some node in a Delay Tolerant Network (DTN), how are we to disseminate the workload during pairwise contacts to minimize the makespan? We first investigate the scenario in which each node has access to an oracle that knows
Results 1  10
of
140