00207543.2014.984502).

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]

Citations (6)

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (2)

Abdelhak Elidrissi, Rachid Benmansour, Mohammed Benbrahim & David Duvivier. (2021) Mathematical formulations for the parallel machine scheduling problem with a single server. International Journal of Production Research 59:20, pages 6166-6184.
Read now

Guo-Sheng Liu, Jin-Jin Li, Hai-Dong Yang & George Q. Huang. (2019) Approximate and branch-and-bound algorithms for the parallel machine scheduling problem with a single server. Journal of the Operational Research Society 70:9, pages 1554-1570.
Read now

Articles from other publishers (4)

Abdelhak Elidrissi, Rachid Benmansour, Keramat Hasani & Frank Werner. (2024) Minimizing the makespan on two parallel machines with a common server in charge of loading and unloading operations. Computers & Operations Research 167, pages 106638.
Crossref

Simon Belieres, Yossiri Adulyasak & Jean-François Cordeau. (2023) Scheduling multi-staged jobs on parallel identical machines and a central server with sequence-dependent setup times: An application to an automated kitchen. Computers & Operations Research 160, pages 106387.
Crossref

Dehua Xu, Guo Li & Faping Zhang. (2021) Scheduling an automatic IoT manufacturing system with multiple servers. Computers & Industrial Engineering 157, pages 107343.
Crossref

Zahra Izadi, Homa Amirian & Rashed Sahraeian. (2019) Solving a Single-Server Parallel Machine Problem with Preventive Maintenances Using a Hyper-Heuristic Algorithm. Solving a Single-Server Parallel Machine Problem with Preventive Maintenances Using a Hyper-Heuristic Algorithm.

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.

Minimising interference for scheduling two parallel machines with a single serverFootnote
This article was originally published with errors. This version has been amended. Please see Corrigendum (http://dx.doi.org/10.1080/00207543.2014.984502).

Articles from other publishers (4)

Information for

Open access

Opportunities

Help and information

Your download is now in progress and you may close this window

Login or register to access this feature

Minimising interference for scheduling two parallel machines with a single serverFootnoteThis article was originally published with errors. This version has been amended. Please see Corrigendum (http://dx.doi.org/10.1080/00207543.2014.984502).

Citations (6)

Read on this site (2)

Articles from other publishers (4)

Reprints and Corporate Permissions

Academic Permissions

Related research

To cite this article:

Download citation

Information for

Open access

Opportunities

Help and information

Keep up to date

Minimising interference for scheduling two parallel machines with a single serverFootnote
This article was originally published with errors. This version has been amended. Please see Corrigendum (http://dx.doi.org/10.1080/00207543.2014.984502).