Advanced search
Publication Cover
International Journal of Production Research Volume 52, 2014 - Issue 13: New Developments in Scheduling and Manufacturing
Submit an article Journal homepage
406
Views
7
CrossRef citations to date
0
Altmetric
Articles

Scheduling unrelated machines with two types of jobs

Nodari VakhaniaScience Faculty, UAEM, Cuernavaca, Mexico.
,
Jose Alberto HernandezScience Faculty, UAEM, Cuernavaca, Mexico.
&
Frank WernerFakultät für Mathematik, Otto-von-Guericke-Universität, Magdeburg, Germany.Correspondence[email protected]
Pages 3793-3801 | Received 26 Mar 2013, Accepted 22 Jan 2014, Published online: 24 Feb 2014

References

  • Davis, E., and J. M. Jaffe. 1981. “Algorithms for Scheduling Tasks on Unrelated Processors.” Journal of the ACM 28: 721–736.
  • Dessouky, M. I., B. J. Lageweg, J. K. Lenstra, and S. L. van de Velde. 1990. “Scheduling Identical Jobs on Uniform Parallel Machines.” Statistica Neerlandica 44: 115–123.
  • Ebenlendr, T., M. Král, and J. Sgall. 2008. “Graph Balancing: A Special Case of Scheduling Unrelated Parallel Machines.” In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, 483–490.
  • Fanjul-Peyro, L., and R. Ruiz. 2010. “Iterated Greedy Local Search Methods for Unrelated Parallel Machine Scheduling.” European Journal of Operational Research 207: 55–69.
  • Fanjul-Peyro, L., and R. Ruiz. 2011. “Size-reduction Heuristics for the Unrelated Parallel Machines Scheduling Problem.” Computers & Operations Research 38: 301–309.
  • Fanjul-Peyro, L., and R. Ruiz. 2012. “Scheduling Unrelated Parallel Machines with Optional Machines and Jobs Selection.” Computers & Operations Research 39: 1745–1753.
  • Friesen, D. K. 1984. “Tighter Bound for the MULTIFIT Processor Scheduling Algorithm.” SIAM Journal on Computing 13: 170–181.
  • Friesen, D. K., and M. A. Langston. 1983. “Bounds for MULTIFIT Scheduling on Uniform Processors.” SIAM Journal on Computing 12: 60–70.
  • Graham, R. L., E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. 1979. “Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey.” Annals of Discrete Mathematics 5: 287–328.
  • Hochbaum, D. S., and D. B. Shmoys. 1988. “A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach.” SIAM Journal on Computing 17: 539–551.
  • Ibarra, O. H., and C. E. Kim. 1977. “Heuristic Algorithms for Scheduling Independent Tasks on Non-identical Processors.” Journal of the ACM 24: 280–289.
  • Kravchenko, S. A., and F. Werner. 2011. “Parallel Machine Problems with Equal Processing Times: A Survey.” Journal of Scheduling 14: 435–444.
  • Lenstra, J. K., D. B. Shmoys, and E. Tardos. 1990. “Approximation Algorithms for Scheduling Unrelated Parallel Machines.” Mathematical Programming 46: 259–271.
  • Potts, C. N. 1985. “Analysis of a Linear Programming Heuristic for Scheduling Unrelated Parallel Machines.” Discrete Applied Mathematics 10: 155–164.
  • Shchepin, E., and N. Vakhania. 2005. “An Optimal Rounding Gives a Better Approximation for Scheduling Unrelated Machines.” Operations Research Letters 33: 127–133.
  • Yue, M. 1990. “On the Exact Upper Bound for the Multifit Processor Scheduling Algorithm.” Annals of Operations Research 24: 233–259.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.