Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Makespan

In operations research, the makespan of a project is the total time that elapses from the beginning to the end. The term commonly appears in the… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Iterated Greedy (IG) algorithms are based on a very simple principle, are easy to implement and can show excellent performance… Expand
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Abstract In this paper, a particle swarm optimization algorithm (PSO) is presented to solve the permutation flowshop sequencing… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We tackle the problem of scheduling task graphs onto a heterogeneous set of machines, where each processor has a probability of… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Abstract We consider a single-machine scheduling problem with periodic maintenance activities. Although the scheduling problem… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Resource-constrained project scheduling problem (RCPSP) is one of the most important problems in the context of project… Expand
  • figure 1
  • figure 2
  • figure 3
  • table 2
  • figure 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Abstract The problem of scheduling in permutation flowshops is considered with the objective of minimizing the makespan, followed… Expand
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2004
Highly Cited
2004
This paper deals with a classic flow-shop scheduling problem with makespan criterion. Some new properties of the problem… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Abstract During execution projects may be subject to considerable uncertainty, which may lead to numerous schedule disruptions… Expand
Is this relevant?
Highly Cited
2004
Highly Cited
2004
During the last decade, considerable research efforts in the project scheduling literature have concentrated on resource… Expand
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We consider the problem of minimizing makespan Cmax on a single batch processing machine in the presence of dynamic job arrivals… Expand
Is this relevant?