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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1978-2018
020040019782018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
In this paper, a particle swarm optimization algorithm (PSO) is presented to solve the permutation flowshop sequencing problem… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
2007
2007
Roughgarden and Sundararajan recently introduced an alternative measure of efficiency for cost sharing mechanisms. We study cost… (More)
Is this relevant?
2007
2007
The completion time or makespan estimation of a set of jobs in batch process industries is studied; Because jobs interact with… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We consider offline scheduling algorithms that incorporate speed scaling to address the bicriteria problem of minimizing energy… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2004
Highly Cited
2004
The problem of scheduling in permutation flowshops is considered with the objective of minimizing the makespan, followed by the… (More)
  • table 1
  • table 2
  • table 3
Is this relevant?
2004
2004
The problem of optimal scheduling n tasks in a parallel processor system is studied. The tasks are malleable, i.e., a task may be… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
This paper addresses the m-machine no-wait #owshop scheduling problem to minimize makespan. We propose two heuristics that are… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 4
Is this relevant?
2002
2002
We describe a simple online heuristic for scheduling job shops. We assume there is a fixed set of routes for the jobs, and many… (More)
  • table 1
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1994
1994
We consider flowshop environments that consist of multiple stages and multiple machines in each stage. The flowshops are flexible… (More)
  • table 1
  • table 2
Is this relevant?
Highly Cited
1989
Highly Cited
1989
In this paper, we propose 260 scheduling problems whose size is greater than that of the rare examples published. Such sizes… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?