Keyword: makespan

Found 22 papers in total
Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem
Combining Column Generation and Lagrangean Relaxation to Solve a Single-Machine Common Due Date Problem
2002,
Column generation has proved to be an effective technique for solving the linear...
The use of buffers in project management: The trade-off between stability and makespan
The use of buffers in project management: The trade-off between stability and makespan
2005,
During execution projects may be subject to considerable uncertainty, which may lead...
A multi-start algorithm for a balanced real-world Open Vehicle Routing Problem
A multi-start algorithm for a balanced real-world Open Vehicle Routing Problem
2014,
The aim of this paper is to solve a real‐world problem proposed by an...
Scheduling controllable processing time jobs in a deteriorating environment
Scheduling controllable processing time jobs in a deteriorating environment
2014,
In many real‐life applications, job processing times are a function of the...
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...
Decentralized list scheduling
Decentralized list scheduling
2013,
Classical list scheduling is a very popular and efficient technique for scheduling...
Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption
Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption
2013,
We consider the rescheduling on a single machine with release dates to minimize the...
Bounded parallel‐batching scheduling with two competing agents
Bounded parallel‐batching scheduling with two competing agents
2013,
We consider a scheduling problem in which two agents, each with a set of...
Job‐shop scheduling in a body shop
Job‐shop scheduling in a body shop
2013,
We study a generalized job‐shop problem called the body shop scheduling problem...
Matching based very large‐scale neighborhoods for parallel machine scheduling
Matching based very large‐scale neighborhoods for parallel machine scheduling
2011,
In this paper we study very large‐scale neighborhoods for the minimum total...
Optimal algorithms for single‐machine scheduling with rejection to minimize the makespan
Optimal algorithms for single‐machine scheduling with rejection to minimize the makespan
2011,
In this paper we consider the single‐machine scheduling problem with rejection....
A best online algorithm for unbounded parallel‐batch scheduling with restarts to minimize makespan
A best online algorithm for unbounded parallel‐batch scheduling with restarts to minimize makespan
2011,
We consider online scheduling with restarts in an unbounded parallel‐batch...
Flow shop scheduling to minimize makespan with decreasing time‐dependent job processing times
Flow shop scheduling to minimize makespan with decreasing time‐dependent job processing times
2011,
In this study, we consider an n ‐job, m ‐machine flow shop scheduling...
A general approach for optimizing regular criteria in the job‐shop scheduling problem
A general approach for optimizing regular criteria in the job‐shop scheduling problem
2011,
Even though a very large number of solution methods has been developed for the...
Some scheduling problems with past sequence dependent setup times under the effects of nonlinear deterioration and time‐dependent learning
Some scheduling problems with past sequence dependent setup times under the effects of nonlinear deterioration and time‐dependent learning
2010,
This paper studies scheduling problems which include a combination of nonlinear job...
Scheduling jobs with equal processing times subject to machine eligibility constraints
Scheduling jobs with equal processing times subject to machine eligibility constraints
2011,
We consider the problem of nonpreemptively scheduling a set of n jobs with equal...
Scheduling UET‐tasks on a star network: complexity and approximation
Scheduling UET‐tasks on a star network: complexity and approximation
2011,
In this article we investigate complexity and approximation on a processor network...
On robust online scheduling algorithms
On robust online scheduling algorithms
2011,
While standard parallel machine scheduling is concerned with good assignments of jobs...
Scheduling deteriorating jobs on a single machine subject to breakdowns
Scheduling deteriorating jobs on a single machine subject to breakdowns
2011,
We investigate the problem of scheduling a set of jobs to minimize the expected...
Single‐machine scheduling problems with past‐sequence‐dependent delivery times
Single‐machine scheduling problems with past‐sequence‐dependent delivery times
2010,
We consider single‐machine scheduling problems with...
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...
An iterative improvement approach for the nonpreemptive open shop scheduling problem
An iterative improvement approach for the nonpreemptive open shop scheduling problem
1998,
This paper addresses the problem of scheduling nonpreemptive open shops with the...
Papers per page: