Time/cost trade-offs have been extensively studied in the literature since the development of the critical path method. Recently, the discrete version of the problem formulation has been extended to various practical assumptions, and solved with both exact and heuristic optimization procedures....

In this paper, we present a novel meta-heuristic technique for the nurse scheduling problem (NSP). This well-known scheduling problem assigns nurses to shifts per day taking both hard and soft constraints into account. The objective is to maximize the preferences of the nurses and to minimize...