Advanced search
Publication Cover
International Journal of Production Research Volume 52, 2014 - Issue 24
Submit an article Journal homepage
438
Views
6
CrossRef citations to date
0
Altmetric
Articles

Minimising interference for scheduling two parallel machines with a single serverFootnote

Keramat HasaniDepartment of Computer Engineering, Malayer Branch, Islamic Azad University, Malayer, Iran
,
Svetlana A. KravchenkoUnited Institute of Informatics Problems, Minsk, Belarus
&
Frank WernerFakultät fur Mathematik, Otto-von-Guericke-Universität Magdeburg, Magdeburg, GermanyCorrespondence[email protected]
Pages 7148-7158 | Received 09 Jul 2014, Accepted 27 Aug 2014, Published online: 25 Sep 2014

References

  • Abdekhodaee, A., and A. Wirth. 2002. “Scheduling Parallel Machines with a Single Server: Some Solvable Cases and Heuristics.” Computers & Operations Research 29: 295–315.
  • Brucker, P., C. Dhaenens-Flipo, S. Knust, S. A. Kravchenko, and F. Werner. 2002. “Complexity Results for Parallel Machine Problems with a Single Server.” Journal of Scheduling 5: 429–457.10.1002/(ISSN)1099-1425
  • Hall, N. G., C. N. Potts, and C. Sriskandarajah. 2000. “Parallel Machine Scheduling with a Common Server.” Discrete Applied Mathematics 102: 223–243.10.1016/S0166-218X(99)00206-1
  • Hasani, K., S. A. Kravchenko, and F. Werner. 2014a. “Simulated Annealing and Genetic Algorithms for the Two-machine Scheduling Problem with a Single Server.” International Journal of Production Research 52 (13): 3778–3792.10.1080/00207543.2013.874607
  • Hasani, K., S. A. Kravchenko, and F. Werner. 2014b. “Minimizing the Makespan for the Two-machine Scheduling Problem with a Single Server: Two Algorithms for Very Large Instances.” Preprint 01/14, Faculty of Mathematics, Otto-von-Guericke-University Magdeburg, 19 pages.
  • Hasani, K., S. A. Kravchenko, and F. Werner. 2014c. “Minimizing Total Weighted Completion Time Approximately for the Parallel Machine Problem with a Single Server.” Information Processing Letters 114: 500–503.10.1016/j.ipl.2014.04.005
  • Hasani, K., S. A. Kravchenko, and F. Werner. 2014d. “Block Models for Scheduling Jobs on Two Parallel Machines with a Single Server.” Computers & Operations Research 41: 94–97.
  • Koulamas, C. P. 1996. “Scheduling Two Parallel Semiautomatic Machines to Minimize Machine Interference.” Computers & Operations Research 23 (10): 945–956.
  • Koulamas, C. P., and M. L. Smith. 1988. “Look-ahead Scheduling for Minimizing Machine Interference.” International Journal of Production Research 26: 1523–1533.10.1080/00207548808947963
  • Kravchenko, S., and F. Werner. 1997. “Parallel Machine Scheduling Problems with a Single Server.” Mathematical and Computer Modelling 26 (12): 1–11.10.1016/S0895-7177(97)00236-7
  • Sotskov, Y. N., N. Y. Sotskova, T.-C. Lai, and F. Werner. 2010. Scheduling under Uncertainty: Theory and Algorithms. Minsk: Belarusian Science.
  • Sotskov, Y. N., and F. Werner, eds. 2014. Sequencing and Scheduling with Inaccurate Data. Hauppauge: Nova Science.

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.