Skip to main content Accessibility help
×
Home
Hostname: page-component-79b67bcb76-x7pwn Total loading time: 0.17 Render date: 2021-05-13T22:51:47.830Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": false, "newCiteModal": false, "newCitedByModal": true, "newEcommerce": true }

SCHEDULING ON TWO PARALLEL MACHINES WITH TWO DEDICATED SERVERS

Published online by Cambridge University Press:  25 May 2017

YIWEI JIANG
Affiliation:
College of Finance and Trade, Ningbo Dahongying University, Ningbo 315175, China email ywjiang@zstu.edu.cn School of Sciences, Zhejiang Sci-Tech University, Hangzhou 310018, China email hujlhz@163.com
PING ZHOU
Affiliation:
College of Humanities, Zhejiang Business College, Hangzhou 310053, China
HUIJUAN WANG
Affiliation:
School of Sciences, Zhejiang Sci-Tech University, Hangzhou 310018, China email hujlhz@163.com
JUELIANG HU
Affiliation:
School of Sciences, Zhejiang Sci-Tech University, Hangzhou 310018, China email hujlhz@163.com
Corresponding

Abstract

We study a nonpreemptive scheduling on two parallel identical machines with a dedicated loading server and a dedicated unloading server. Each job has to be loaded by the loading server before being processed on one of the machines and unloaded immediately by the unloading server after its processing. The loading and unloading times are both equal to one unit of time. The goal is to minimize the makespan. Since the problem is NP-hard, we apply the classical list scheduling and largest processing time heuristics, and show that they have worst-case ratios, $8/5$ and $6/5$ , respectively.

Type
Research Article
Copyright
© 2017 Australian Mathematical Society 

Access options

Get access to the full version of this content by using one of the access options below.

References

Batur, G., Karasan, O. and Akturk, M., “Multiple part-type scheduling in flexible robotic cells”, Int. J. Product. Econ. 135 (2012) 726740; doi:10.1016/j.ijpe.2011.10.006.CrossRefGoogle Scholar
Brucker, P., Dhaenens-Flipo, C., Knust, S., Kravchenko, S. A. and Werner, F., “Complexity results for parallel machine problems with a single server”, J. Sched. 5 (2002) 429457; doi:10.1002/jos.120.CrossRefGoogle Scholar
Hall, N., Potts, C. and Sriskandarajah, C., “Parallel machine scheduling with a common server”, Discrete Appl. Math. 102 (2000) 223243; doi:10.1016/S0166-218X(99)00206-1.CrossRefGoogle Scholar
Jiang, Y., Dong, J. and Ji, M., “Preemptive scheduling on two parallel machines with a single server”, Comput. Ind. Eng. 66 (2013) 514518; doi:10.1016/j.cie.2013.07.020.CrossRefGoogle Scholar
Jiang, Y., Wang, H. and Zhou, P., “An optimal preemptive algorithm for the single-server parallel-machine scheduling with loading and unloading times”, Asia-Pac. J. Oper. Res. 32 (2014) 11 pages; doi:10.1142/S0217595914500390.Google Scholar
Jiang, Y., Yu, F., Zhou, P. and Hu, J., “Online algorithms for scheduling on two parallel machines with a single server”, Int. Trans. Oper. Res. 22 (2015) 913927; doi:10.1111/itor.12136.CrossRefGoogle Scholar
Jiang, Y., Zhang, Q., Hu, J., Dong, J. and Ji, M., “Single-server parallel-machine schduling with loading and unloading times”, J. Comb. Optim. 30 (2015) 201213; doi:10.1007/s10878-014-9727-z.CrossRefGoogle Scholar
Kim, M. Y. and Lee, Y. H., “MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server”, Comput. Oper. Res. 39 (2012) 24572468; doi:10.1016/j.cor.2011.12.011.CrossRefGoogle Scholar
Koulamas, C., “Scheduling two parallel semiautomatic machines to minimize machine interference”, Comput. Oper. Res. 23 (1996) 945956; doi:10.1016/0305-0548(96)00011-1.CrossRefGoogle Scholar
Kravchenko, S. and Werner, F., “Parallel machine scheduling problems with a single server”, Math. Comput. Modelling 26 (1997) 111; doi:10.1016/S0895-7177(97)00236-7.CrossRefGoogle Scholar
Ou, J., Qi, X. and Lee, C., “Parallel machine scheduling with multiple unloading servers”, J. Sched. 13 (2010) 213226; doi:10.1007/s10951-009-0104-1.CrossRefGoogle Scholar
Su, C., “Online LPT algorithms for parallel machines scheduling with a single server”, J. Comb. Optim. 26 (2013) 480488; doi:10.1007/s10878-011-9441-z.CrossRefGoogle Scholar
Wang, G. and Cheng, T. C. E., “An approximation algorithm for parallel machine scheduling with a common server”, J. Oper. Res. Soc. 52 (2001) 234237; doi:10.1057/palgrave.jors.2601074.CrossRefGoogle Scholar
Werner, F. and Kravchenko, S., “Scheduling with multiple servers”, Autom. Remote Control 71 (2010) 21092121; doi:10.1134/S0005117910100103.CrossRefGoogle Scholar
Xie, X., Li, Y., Zhou, H. and Zheng, Y., “Scheduling parallel machines with a single server”, in: Measurement, information and control (MIC) (IEEE, Harbin, China, 2012) 453456; doi:10.1109/MIC.2012.6273340.Google Scholar
Zhang, L. and Wirth, A., “On-line scheduling of two parallel machines with a single server”, Comput. Oper. Res. 36 (2009) 15291553; doi:10.1016/j.cor.2008.02.015.CrossRefGoogle Scholar

Send article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

SCHEDULING ON TWO PARALLEL MACHINES WITH TWO DEDICATED SERVERS
Available formats
×

Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

SCHEDULING ON TWO PARALLEL MACHINES WITH TWO DEDICATED SERVERS
Available formats
×

Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

SCHEDULING ON TWO PARALLEL MACHINES WITH TWO DEDICATED SERVERS
Available formats
×
×

Reply to: Submit a response


Your details


Conflicting interests

Do you have any conflicting interests? *