Results 1  10
of
1,381,813
identical Parallel Machine Flow Shop
"... Abstract. The drumbufferrope (DBR) is a scheduling technique under the Theory of Constraints (TOC) philosophy. In DBR, “drum ” is a schedule at the bottleneck, “rope ” is a mechanism to release the required material to the bottleneck, and “buffer ” is used to protect the bottleneck from starvation ..."
Abstract
 Add to MetaCart
starvation due to statistical fluctuations. For a nonidentical parallel machine flow shop environment, estimating rope and time buffer is not an easy task because of the complexity of nonidentical parallel machine loading. This paper proposes a new scheduling method, which is called modified DBR (Mod
Total stretch minimization on single and identical parallel machines
"... Abstract. We consider the classical problem of scheduling n jobs with release dates on both single and identical parallel machines. We measure the quality of service provided to each job by its stretch, which is defined as the ratio of its response time to processing time. Our objective is to schedu ..."
Abstract
 Add to MetaCart
Abstract. We consider the classical problem of scheduling n jobs with release dates on both single and identical parallel machines. We measure the quality of service provided to each job by its stretch, which is defined as the ratio of its response time to processing time. Our objective
Tight Bounds for the Identical Parallel Machine Scheduling Problem
"... We address the problem of minimizing makespan on identical parallel machines. We propose new lower bounding strategies and heuristics for this fundamental scheduling problem. The lower bounds are based on the socalled lifting procedure. In addition, two optimizationbased heuristics are proposed. T ..."
Abstract
 Add to MetaCart
We address the problem of minimizing makespan on identical parallel machines. We propose new lower bounding strategies and heuristics for this fundamental scheduling problem. The lower bounds are based on the socalled lifting procedure. In addition, two optimizationbased heuristics are proposed
Scheduling EqualLength Jobs on Identical Parallel Machines
, 2000
"... We study the situation where a set of n jobs with release dates and equal processing times have to be scheduled on m identical parallel machines. We show that, if the objective function can be expressed as the sum of n functions f i of the completion time C i of each job J i , the problem can be sol ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
We study the situation where a set of n jobs with release dates and equal processing times have to be scheduled on m identical parallel machines. We show that, if the objective function can be expressed as the sum of n functions f i of the completion time C i of each job J i , the problem can
A Constructive Algorithm to Minimise the Makespan on Identical Parallel Machines
"... In this paper we present constructive algorithms for the classical deterministic scheduling problem of minimising the makespan on identical parallel machines. Since the problem is known to be NPhard in the strong sense, the approximate ..."
Abstract
 Add to MetaCart
In this paper we present constructive algorithms for the classical deterministic scheduling problem of minimising the makespan on identical parallel machines. Since the problem is known to be NPhard in the strong sense, the approximate
Scheduling algorithm based on evolutionary computing in identical parallel machine production line
, 2003
"... Evolutionary programming is a kind of evolutionary computing method based on stochastic search suitable for solving system optimization. In this paper, evolutionary programming method is applied to the identical parallel machine production line scheduling problem of minimizing the number of tardy jo ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Evolutionary programming is a kind of evolutionary computing method based on stochastic search suitable for solving system optimization. In this paper, evolutionary programming method is applied to the identical parallel machine production line scheduling problem of minimizing the number of tardy
MAKESPAN MINIMIZATION ON IDENTICAL PARALLEL MACHINES SUBJECT TO MINIMUM TOTAL FLOWTIME
"... We consider the problem of scheduling n jobs on m identical parallel machines. An optimal schedule to the proposed problem is defined as one that gives the smallest makespan (the completion time of the last job on any one of the parallel machines) among the set of all schedules with optimal total fl ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We consider the problem of scheduling n jobs on m identical parallel machines. An optimal schedule to the proposed problem is defined as one that gives the smallest makespan (the completion time of the last job on any one of the parallel machines) among the set of all schedules with optimal total
Minimization of job waiting time variance on identical parallel machines, submitted for publication
"... Abstract—We consider the problem of scheduling n independent jobs on m identical parallel machines so as to minimize the waiting time variance of the jobs (PmWTV). We show that the optimal value of PmWTV is identical to the optimal value of the problem for minimizing the completion time varianc ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract—We consider the problem of scheduling n independent jobs on m identical parallel machines so as to minimize the waiting time variance of the jobs (PmWTV). We show that the optimal value of PmWTV is identical to the optimal value of the problem for minimizing the completion time
Is A UnitTime Job Shop Not Easier Than Identical Parallel Machines?
 Discrete Appl. Math
, 1998
"... . This paper gives the positive answer to the question posed in the title for a wide class of minimization criteria including the maximum completion time, maximum lateness, total completion time, total weighted completion time, total tardiness, total weighted tardiness, number of late jobs and th ..."
Abstract

Cited by 8 (7 self)
 Add to MetaCart
and the weighted number of late jobs. That is any scheduling problem for m identical parallel machines to minimize a criterion of the class reduces to a scheduling problem for an mmachine unittime job shop to minimize the same criterion. Employing this general reduction we prove the NPhardness of unit
A PTAS For Minimizing The Total Weighted Completion Time On Identical Parallel Machines
 MATHEMATICS OF OPERATIONS RESEARCH
, 1999
"... We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NPhard in the strong sense. The best approximation result known so far was a 1 2 (1 + p 2)approximation algorithm that has been der ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NPhard in the strong sense. The best approximation result known so far was a 1 2 (1 + p 2)approximation algorithm that has been
Results 1  10
of
1,381,813