Task assignment and sequencing decision model under uncertain available time of service providers

References

• Albareda-Sambola, M., Van der Vlerk, M. H., & Fernández, E. (2006). Exact solutions to a class of stochastic generalized assignment problems. European Journal of Operational Research, 173(2), 465–487.10.1016/j.ejor.2005.01.035
   Web of Science ®Google Scholar
• Avriel, M., & Williams, A. C. (1970). The value of information and stochastic programming. Operations Research, 18(5), 947–954.10.1287/opre.18.5.947
   Web of Science ®Google Scholar
• Burke, E. K., Hyde, M. R., & Kendall, G. (2011). A squeaky wheel optimisation methodology for two-dimensional strip packing. Computers & Operations Research, 38(7), 1035–1044.10.1016/j.cor.2010.10.005
   Web of Science ®Google Scholar
• Cattrysse, D. G., & Van Wassenhove, L. N. (1992). A survey of algorithms for the generalized assignment problem. European Journal of Operational Research, 60(3), 260–272.10.1016/0377-2217(92)90077-M
   Web of Science ®Google Scholar
• Cheung, R. K., Hang, D. D., & Shi, N. (2005). A labeling method for dynamic driver-task assignment with uncertain task durations. Operations Research Letters, 33(4), 411–420.10.1016/j.orl.2004.08.006
   Web of Science ®Google Scholar
• Clements, D. P., Crawford, J. M., Joslin, D. E., Nemhauser, G. L., Puttlitz, M. E., Savelsbergh, M. W. P. (1997). Heuristic optimization: A hybrid AI/OR approach. Proceedings of the workshop on industrial constraint-directed scheduling.
   Google Scholar
• Fanjul-Peyro, L., Perea, F., & Ruiz, R. (2017). Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources. European Journal of Operational Research, 260(2), 482–493.10.1016/j.ejor.2017.01.002
   Web of Science ®Google Scholar
• Gara-Ali, A., Finke, G., & Espinouse, M.-L. (2016). Parallel-machine scheduling with maintenance: Praising the assignment problem. European Journal of Operational Research, 252(1), 90–97.10.1016/j.ejor.2015.12.047
   Web of Science ®Google Scholar
• Garey, M. R., & Johnson, M. R. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman.
   Google Scholar
• Gedik, R., Rainwater, C., Nachtmann, H., & Pohl, E. A. (2016). Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals. European Journal of Operational Research, 251(2), 640–650.10.1016/j.ejor.2015.11.020
   Web of Science ®Google Scholar
• Güler, M. G., Keskin, M. E., Döyen, A., & Akyer, H. (2015). On teaching assistant-task assignment problem: A case study. Computers & Industrial Engineering, 79, 18–26.10.1016/j.cie.2014.10.004
   Web of Science ®Google Scholar
• Haddadi, S., & Ouzia, H. (2004). Effective algorithm and heuristic for the generalized assignment problem. European Journal of Operational Research, 153(1), 184–190.10.1016/S0377-2217(02)00710-5
   Web of Science ®Google Scholar
• Krokhmal, P. A., & Pardalos, P. M. (2009). Random assignment problems. European Journal of Operational Research, 194(1), 1–17.10.1016/j.ejor.2007.11.062
   Web of Science ®Google Scholar
• Lalla-Ruiz, E., & Voß, S. (2016). Modeling the parallel machine scheduling problem with step deteriorating jobs. European Journal of Operational Research, 255(1), 21–33.10.1016/j.ejor.2016.04.010
   Web of Science ®Google Scholar
• Lee, J.-Y., & Kim, Y.-D. (2015). A branch and bound algorithm to minimize total tardiness of jobs in a two identical-parallel-machine scheduling problem with a machine availability constraint. Journal of the Operational Research Society, 66(9), 1542–1554.10.1057/jors.2014.122
   Web of Science ®Google Scholar
• Lequy, Q., Desaulniers, G., & Solomon, M. M. (2012). A two-stage heuristic for multi-activity and task assignment to work shifts. Computers & Industrial Engineering, 63(4), 831–841.10.1016/j.cie.2012.05.005
   Web of Science ®Google Scholar
• Liu, C.-H., & Tsai, W.-N. (2016). Multi-objective parallel machine scheduling problems by considering controllable processing times. Journal of the Operational Research Society, 67(4), 654–663.10.1057/jors.2015.82
   Web of Science ®Google Scholar
• Meisel, F., & Bierwirth, C. (2009). Heuristics for the integration of crane productivity in the berth allocation problem. Transportation Research Part E, 45(1), 196–209.10.1016/j.tre.2008.03.001
   Google Scholar
• Øvstebø, B. O., Hvattum, L. M., & Fagerholt, K. (2011). Routing and scheduling of RoRo ships with stowage constraints. Transportation Research Part C, 19(6), 1225–1242.10.1016/j.trc.2011.02.001
   Web of Science ®Google Scholar
• Pentico, D. W. (2007). Assignment problems: A golden anniversary survey. European Journal of Operational Research, 176(2), 774–793.10.1016/j.ejor.2005.09.014
   Web of Science ®Google Scholar
• Sels, V., Coelho, J., Dias, A. M., & Vanhoucke, A. (2015). Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem. Computers & Operations Research, 53, 107–117.10.1016/j.cor.2014.08.002
   Web of Science ®Google Scholar
• Shams, H., & Salmasi, N. (2014). Parallel machine scheduling problem with preemptive jobs and transportation delay. Computers & Operations Research, 50, 14–23.10.1016/j.cor.2014.04.008
   Web of Science ®Google Scholar
• Umang, N., Bierlaire, M., & Vacca, I. (2013). Exact and heuristic methods to solve the berth allocation problem in bulk ports. Transportation Research Part E, 54, 14–31.10.1016/j.tre.2013.03.003
   Google Scholar
• Woodcock, A. J., & Wilson, J. M. (2010). A hybrid tabu search/branch & bound approach to solving the generalized assignment problem. European Journal of Operational Research, 207(2), 566–578.10.1016/j.ejor.2010.05.007
   Web of Science ®Google Scholar
• Xie, Y., Chien, C.-F., Tang, R.-Z. (in press). A dynamic task assignment approach based on individual worklists for minimizing the cycle time of business processes. Computers & Industrial Engineering, 90, 401–414.
   Google Scholar
• Yan, S., & Tang, C.-H. (2007). A heuristic approach for airport gate assignments for stochastic flight delays. European Journal of Operational Research, 180(2), 547–567.10.1016/j.ejor.2006.05.002
   Web of Science ®Google Scholar
• Zhang, Z., & Daigle, J. (2012). Analysis of job assignment with batch arrivals among heterogeneous servers. European Journal of Operational Research, 217(1), 149–161.10.1016/j.ejor.2011.09.001
   Web of Science ®Google Scholar
• Zhen, L. (2015). Task assignment under uncertainty: Stochastic programming and robust optimisation approaches. International Journal of Production Research, 53(5), 1487–1502.10.1080/00207543.2014.951094
   Web of Science ®Google Scholar
• Zhen, L. (2016). Modeling of yard congestion and optimization of yard template in container ports. Transportation Research Part B, 90, 83–104.10.1016/j.trb.2016.04.011
   Google Scholar
• Zhen, L., Chew, E. P., & Lee, L. H. (2011). An integrated model for berth template and yard template planning in transshipment hubs. Transportation Science, 45(4), 483–504.10.1287/trsc.1100.0364
   Web of Science ®Google Scholar