Exact and metaheuristic approaches for identical parallel machine scheduling with a common server and sequence-dependent setup times

References

• Abdekhodaee, A. H., Wirth, A., & Gan, H. S. (2004). Equal processing and equal setup time cases of scheduling parallel machines with a single server. Computers & Operations Research, 31(11), 1867–1889. doi:10.1016/S0305-0548(03)00144-8
   Web of Science ®Google Scholar
• Abdekhodaee, A. H., Wirth, A., & Gan, H.-S. (2006). Scheduling two parallel machines with a single server: The general case. Computers & Operations Research, 33(4), 994–1009. doi:10.1016/j.cor.2004.08.013
   Web of Science ®Google Scholar
• Balakrishnan, N., Kanet, J. J., & Sridharan, V. (1999). Early/tardy scheduling with sequence dependent setups on uniform parallel machines. Computers & Operations Research, 26(2), 127–141. doi:10.1016/S0305-0548(98)00051-3
   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. doi:10.1016/j.cor.2011.11.007
   Web of Science ®Google Scholar
• Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A.H.G.Rinnooy (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics,, 5, 287–326. doi:10.1016/S0167-5060(08)70356-X.
   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. doi:10.1016/S0166-218X(99)00206-1
   Web of Science ®Google Scholar
• Hamzadayi, A., & Yildiz, G. (2016). Hybrid strategy based complete rescheduling approaches for dynamic m identical parallel machines scheduling problem with a common server. Simulation Modelling Practice and Theory, 63, 104–132. doi:10.1016/j.simpat.2016.02.010
   Web of Science ®Google Scholar
• Hamzadayi, A., & Yildiz, G. (2017). Modeling and solving static m identical parallel machines scheduling problem with a common server and sequence dependent setup times. Computers & Industrial Engineering, 106, 287–298. doi:10.1016/j.cie.2017.02.013
   Web of Science ®Google Scholar
• Hasani, K., Kravchenko, S. A., & Werner, F. (2014a). Block models for scheduling jobs on two parallel machines with a single server. Computers & Operations Research, 41(1), 94–97. doi:10.1016/j.cor.2013.08.015
   Web of Science ®Google Scholar
• Hasani, K., Kravchenko, S. A., & Werner, F. (2014). Simulated annealing and genetic algorithms for the two-machine scheduling problem with a single server. International Journal of Production Research, 52(13), 3778–3792. doi:10.1080/00207543.2013.874607
   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. doi:10.1016/j.cie.2009.10.003
   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. doi:10.1016/j.cor.2011.12.011
   Web of Science ®Google Scholar
• Kramer, A., & Subramanian, A. (2019). A unified heuristic and an annotated bibliography for a large class of earliness–tardiness scheduling problems. Journal of Scheduling, 22(1), 21–57 doi:10.1007/s10951-017-0549-6
   Web of Science ®Google Scholar
• Lourenço, H. R., Martin, O. C., & Stützle, T. (2019). Iterated local search: Framework and applications. In M. Gendreau and J.-Y. Potvin (Eds.), Handbook of metaheuristics (Chapter 5, pp. 129–168). Cham: Springer International Publishing.
   Google Scholar
• Nesello, V., Subramanian, A., Battarra, M., & Laporte, G. (2018). Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times. European Journal of Operational Research, 266(2), 498–507. doi:10.1016/j.ejor.2017.10.020
   Web of Science ®Google Scholar
• Pessoa, A., Uchoa, E., Poggi de Aragão, M., & Rodrigues, R. (2010). Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems. Mathematical Programming Computation, 2(3/4), 259–290. doi:10.1007/s12532-010-0019-z
   Google Scholar
• Silva, Y. L. T. V., Subramanian, A., & Pessoa, A. A. (2018). Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times. Computers & Operations Research, 90, 142–160. doi:10.1016/j.cor.2017.09.006
   Web of Science ®Google Scholar
• Subramanian, A., Battarra, M., & Potts, C. (2014). 17). An iterated local search heuristic for the single machine total weighted tardiness problem with sequence-dependent setup times. International Journal of Production Research, 52(9), 2729–2742. doi:10.1080/00207543.2014.883472
   Web of Science ®Google Scholar
• Subramanian, A., & Farias, K. (2017). Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times. Computers & Operations Research, 79, 190–206. doi:10.1016/j.cor.2016.10.008
   Web of Science ®Google Scholar
• Zhang, L., & Wirth, A. (2009). On-line scheduling of two parallel machines with a single server. Computers & Operations Research, 36(5), 1529–1553. doi:10.1016/j.cor.2008.02.015
   Web of Science ®Google Scholar