Keyword: parallel machines

Found 20 papers in total
Online algorithms for scheduling two parallel machines with a single server
Online algorithms for scheduling two parallel machines with a single server
2015,
We consider an online scheduling problem on two identical parallel machines with a...
Some aging properties of parallel and series systems with a random number of components
Some aging properties of parallel and series systems with a random number of components
2014,
In this article, we study aging properties of parallel and series systems with a...
Graph Balancing: A Special Case of Scheduling Unrelated Parallel Machines
Graph Balancing: A Special Case of Scheduling Unrelated Parallel Machines
2014,
We design a 1.75‐approximation algorithm for a special case of scheduling...
An iterative approach for the serial batching problem with parallel machines and job families
An iterative approach for the serial batching problem with parallel machines and job families
2013,
In this paper, we consider a parallel machine scheduling problem to minimize the total...
Makespan minimization in online scheduling with machine eligibility
Makespan minimization in online scheduling with machine eligibility
2013,
In this paper we provide a survey of online scheduling in parallel machine...
Load balancing a priori strategy for the probabilistic weighted flowtime problem
Load balancing a priori strategy for the probabilistic weighted flowtime problem
2013,
In a previous work (Bouyahia et al., 2010), we introduced and studied the...
A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria
A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria
2012,
We consider the multiprocessor scheduling problem in which independent jobs are...
Parallel machine problems with equal processing times: a survey
Parallel machine problems with equal processing times: a survey
2011,
The basic scheduling problem we are dealing with is the following. There are n jobs,...
New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem
New formulation for the high multiplicity asymmetric traveling salesman problem with application to the Chesapeake problem
2011,
This paper presents a new model for a special type of traveling salesman problem...
Scheduling UET‐UCT tasks: branch‐and‐bound search in the priority space
Scheduling UET‐UCT tasks: branch‐and‐bound search in the priority space
2010,
The paper is concerned with the problem of scheduling partially ordered unit execution...
Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods
Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods
2010,
This paper addresses an identical parallel machine scheduling problem with job release...
Makespan minimization in online scheduling with machine eligibility
Makespan minimization in online scheduling with machine eligibility
2010,
In this paper we provide a survey of online scheduling in parallel machine...
Parallel machine scheduling problems considering regular measures of performance and machine cost
Parallel machine scheduling problems considering regular measures of performance and machine cost
2010,
This research considers a broad range of scheduling problems in the parallel machines...
Parallel machine scheduling problems: A survey
Parallel machine scheduling problems: A survey
2001,
During the last ten years, the parallel machine scheduling problems have been...
Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness
Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness
1999,
We study the problem of scheduling n jobs on several parallel identical machines. An...
Flowshop scheduling with identical jobs and uniform parallel machines
Flowshop scheduling with identical jobs and uniform parallel machines
1998,
The single-stage scheduling problem to minimize the makespan of identical jobs on...
Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
1996,
In 1954, Johnson gave an efficient algorithm for minimizing makespan in a two-machine...
A general lower bound for the makespan problem
A general lower bound for the makespan problem
1996,
The problem of scheduling jobs on identical parallel processors to minimize makespan...
Using short-term dedication for scheduling multiple products on parallel machines
Using short-term dedication for scheduling multiple products on parallel machines
1992,
In a multiproduct, parallel machine environment, it may be beneficial to dedicate one...
Dynamic feeding in a stochastic parallel processing system
Dynamic feeding in a stochastic parallel processing system
1992,
This paper considers a dynamic input scheduling problem of a stochastic parallel...
Papers per page: