Rescheduling to minimize makespan under a limit on the makespan of the original jobs

@article{Mu2010ReschedulingTM,
  title={Rescheduling to minimize makespan under a limit on the makespan of the original jobs},
  author={Yundong Mu and Cunchang Gu},
  journal={2010 The 2nd International Conference on Computer and Automation Engineering (ICCAE)},
  year={2010},
  volume={1},
  pages={613-617}
}
We consider the rescheduling problems arising when two agents, each with a set of nonpreemptive jobs, compete to perform their respective jobs on a common processing resource. Each agent wants to minimize a certain objective function, which depends on the completion time of its jobs only. In this paper, we consider the two agents rescheduling problem for jobs on a single machine to minimize makespan under a limit on the makespan of the original jobs. We show that the considered problems can be… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Poots, Rescheduling for new orders[J

C.N.N.G. Hall
Operations Research, • 2004
View 2 Excerpts

Scheduling Algorithms[M

P. Brucker
2001

A rescheduling procedure for manufacturing systems under random disruptions[J]. New Directions for Operations Research in Manufacturing (G.Fandel

S. D. Wu, R. H. Storer, P. C. Chang
1992
View 1 Excerpt

Optimization and approximation in deterministic machine scheduling: A survey[J

R. L. Graham, E. L. Lawler, J. K. Lenstra, A.H.G.Rinnooy Kan
Annals of Discrete Mathematics, • 1979

Similar Papers

Loading similar papers…