A list-scheduling heuristic for the short-term planning of assessment centers.

*(English)*Zbl 1392.90070Summary: Many companies operate assessment centers to help them select candidates for open job positions. During the assessment process, each candidate performs a set of tasks, and the candidates are evaluated by some so-called assessors. Additional constraints such as preparation and evaluation times, actors’ participation in tasks, no-go relationships, and prescribed time windows for lunch breaks contribute to the complexity of planning such assessment processes. We propose a multi-pass list-scheduling heuristic for this novel planning problem; to this end, we develop novel procedures for devising appropriate scheduling lists and for generating a feasible schedule. The computational results for a set of example problems that represent or are derived from real cases indicate that the heuristic generates optimal or near-optimal schedules within relatively short CPU times.

##### MSC:

90B35 | Deterministic scheduling theory in operations research |

68M20 | Performance evaluation, queueing, and scheduling in the context of computer systems |

91B74 | Economic models of real-world systems (e.g., electricity markets, etc.) |

90C59 | Approximation methods and heuristics in mathematical programming |

##### Keywords:

real-world application; human resource management; assessment center; list scheduling; multi-pass heuristic
PDF
BibTeX
XML
Cite

\textit{A. Zimmermann} and \textit{N. Trautmann}, J. Sched. 21, No. 2, 131--142 (2018; Zbl 1392.90070)

Full Text:
DOI

##### References:

[1] | Adam, TL; Chandy, KM; Dickson, JR, A comparison of List schedules for parallel processing systems, Communications of the ACM, 17, 685-689, (1997) · Zbl 0293.68047 |

[2] | Boctor, F. F. (1993). Heuristics for scheduling projects with resource restrictions and several resource-duration modes. The International Journal of Production Research, 31(11), 2547-2558. |

[3] | Carter, MW; Laporte, G; Burke, EK (ed.); Carter, MW (ed.), Recent developments in practical course timetabling, 3-19, (1998), Berlin |

[4] | Cavalcante, CCB; Souza, CC; Savelsbergh, MWP; Wang, Y; Wolsey, LA, Scheduling projects with labor constraints, Discrete Applied Mathematics, 112, 27-52, (2001) · Zbl 0984.90012 |

[5] | Damodaran, P; Vélez-Gallego, MC; Maya, J, A GRASP approach for makespan minimization on parallel batch processing machines, Journal of Intelligent Manufacturing, 22, 767-777, (2011) |

[6] | Drezet, LE; Billaut, JC, A project scheduling problem with labour constraints and time-dependent activities requirements, International Journal of Production Economics, 112, 217-225, (2008) |

[7] | Hartmann, S. (1999). Project scheduling under limited resources: Models, methods, and applications. Berlin: Springer. · Zbl 0957.90059 |

[8] | Huselid, MA, The impact of human resource management practices on turnover, productivity, and corporate financial performance, Academy of Management Journal, 38, 635-672, (1995) |

[9] | Li, H; Womer, K, Modeling the supply chain configuration problem with resource constraints, European Journal of Operational Research, 26, 646-654, (2008) |

[10] | Rihm, T., & Trautmann, N. (2016). A decomposition approach for an assessment center planning problem. In: R. Ruiz & R. Alvarez-Valdes (Eds.), Proceedings of the 15th international conference on project management and scheduling, Valencia (pp. 206-209). |

[11] | Salewski, F; Schirmer, A; Drexl, A, Project scheduling under resource and mode identity constraints: model, complexity, methods, and application, European Journal of Operational Research, 102, 88-110, (1997) · Zbl 0948.90060 |

[12] | Spychalski, AC; Quinones, MA; Gaugler, BB; Pohley, K, A survey of assessment center practices in organizations in the united states, Personnel Psychology, 50, 71-90, (1997) |

[13] | Talbot, FB, Resource-constrained project scheduling with time-resource tradeoffs: the nonpreemptive case, Management Science, 28, 1197-1210, (1982) · Zbl 0493.90042 |

[14] | Tareghian, HR; Taheri, SH, A solution procedure for the discrete time, cost and quality tradeoff problem using electromagnetic scatter search, Applied Mathematics and Computation, 190, 1136-1145, (2007) · Zbl 1227.90019 |

[15] | Wren, A; Burke, EK (ed.); Ross, P (ed.), Scheduling, timetabling and rostering—A special relationship?, 46-75, (1996), Berlin |

[16] | Zimmermann, A., & Trautmann, N. (2014). Scheduling of assessment centers: An application of resource-constrained project scheduling. In T. Fliedner, R. Kolisch & A. Naber (Eds.), Proceedings of the 14th international conference on project management and scheduling, Munich (pp. 263-266). |

[17] | Zimmermann, A., & Trautmann, N. (2015). A list-scheduling approach for the planning of assessment centers. In Z. Hanzálek, G. Kendall, B. McCollum & P. Šůcha (Eds.), Proceedings of the multidisciplinary international scheduling conference: Theory and application, Prague (pp. 541-554). |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.