Approximate and branch-and-bound algorithms for the parallel machine scheduling problem with a single server

References

• Abdekhodaee, A., & Wirth, A. (2002). Scheduling parallel machines with a single server: Some solvable cases and heuristics. Computers & Operations Research, 29(3), 295–315.
   Web of Science ®Google Scholar
• Abdekhodaee, A., Wirth, A., & Gan, H. S. (2006). Scheduling two parallel machines with a single server: The general case. Computers & Operations Research, 33(4), 994–1009.
   Web of Science ®Google Scholar
• Allahverdi, A., Ng, C. T., Cheng, T. E., & Kovalyov, M. Y. (2008). A survey of scheduling problems with setup times or costs. European Journal of Operational Research, 187(3), 985–1032.
   Web of Science ®Google Scholar
• Arnaout, J. P. (2017). Heuristics for the two‐machine scheduling problem with a single server. International Transactions in Operational Research, 24(6), 1347–1355.
   Web of Science ®Google Scholar
• Brucker, P., Dhaenens-Flipo, C., Knust, S., Kravchenko, S., & Werner, F. (2002). Complexity results for parallel machine problems with a single server. Journal of Scheduling, 5(6), 429–457.
   Web of Science ®Google Scholar
• Dobson, G., & Karmarkar, U. S. (1989). Simultaneous resource scheduling to minimize weighted flow times. Operations Research, 37(4), 592–600.
   Web of Science ®Google Scholar
• Gan, H. S., Wirth, A., & Abdekhodaee, A. (2012). A branch-and-price algorithm for the general case of scheduling parallel machines with a single server. Computers & Operations Research, 39(9), 2242–2247.
   Web of Science ®Google Scholar
• Glass, C. A., Shafransky, Y. M., & Strusevich, V. A. (2000). Scheduling for parallel dedicated machines with a single server. Naval Research Logistics, 47(4), 304–328.
   Web of Science ®Google Scholar
• Hall, N. G., Potts, C. N., & Sriskandarajah, C. (2000). Parallel machine scheduling with a common server. Discrete Applied Mathematics, 102(3), 223–243.
   Web of Science ®Google Scholar
• Hasani, K., Kravchenko, S. A., & Werner, F. (2014a). Minimizing total weighted completion time approximately for the parallel machine problem with a single server. Information Processing Letters, 114(9), 500–503.
   Web of Science ®Google Scholar
• Hasani, K., Kravchenko, S. A., & Werner, F. (2014b). Minimising interference for scheduling two parallel machines with a single server. International Journal of Production Research, 52(24), 7148–7158.
   Web of Science ®Google Scholar
• Hasani, K., Kravchenko, S. A., & Werner, F. (2014c). Simulated annealing and genetic algorithms for the two-machine scheduling problem with a single server. International Journal of Production Research, 52(13), 3778–3792.
   Web of Science ®Google Scholar
• Hasani, K., Kravchenko, S. A., & Werner, F. (2016). Minimizing the makespan for the two-machine scheduling problem with a single server: Two algorithms for very large instances. Engineering Optimization, 48(1), 173–183.
   Web of Science ®Google Scholar
• Huang, S., Cai, L., & Zhang, X. (2010). Parallel dedicated machine scheduling problem with sequence-dependent setups and a single server. Computers & Industrial Engineering, 58(1), 165–174.
   Web of Science ®Google Scholar
• Jiang, Y., Zhang, Q., Hu, J., Dong, J., & Ji, M. (2015). Single-server parallel-machine scheduling with loading and unloading times. Journal of Combinatorial Optimization, 30(2), 201–213.
   Web of Science ®Google Scholar
• Kim, M. Y., & Lee, Y. H. (2012). MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server. Computers & Operations Research, 39(11), 2457–2468.
   Web of Science ®Google Scholar
• Liu, G.-S., Zhou, Y., & Yang, H.-D. (2017). Minimizing energy consumption and tardiness penalty for fuzzy flow shop scheduling with state-dependent setup time. Journal of Cleaner Production, 147, 470–484.
   Web of Science ®Google Scholar
• Ou, J., Qi, X., & Lee, C. Y. (2010). Parallel machine scheduling with multiple unloading servers. Journal of Scheduling, 13(3), 213–226.
   Web of Science ®Google Scholar
• Smith, W. E. (1956). Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3(1–2), 59–66.
   Google Scholar
• Tang, L., Li, F., & Liu, J. (2015). Integrated scheduling of loading and transportation with tractors and semitrailers separated. Naval Research Logistics, 62(5), 416–433.
   Web of Science ®Google Scholar
• Wang, G., & Cheng, T. E. (2001). An approximation algorithm for parallel machine scheduling with a common server. Journal of the Operational Research Society, 52(2), 234–237.
   Web of Science ®Google Scholar
• Zhang, A., Wang, H., Chen, Y., & Chen, G. (2016). Scheduling jobs with equal processing times and a single server on parallel identical machines. Discrete Applied Mathematics, 213(10), 196–206.
   Web of Science ®Google Scholar