Job shop scheduling by simulated annealing
Operations Research
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Applying tabu search to the job-shop scheduling problem
Annals of Operations Research - Special issue on Tabu search
A fast taboo search algorithm for the job shop problem
Management Science
Proceedings of the Symposium on Human Interface 2009 on Human Interface and the Management of Information. Information and Interaction. Part II: Held as part of HCI International 2009
Co-evolution of cooperative strategies under egoism
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Psychological preference-based optimization framework on the nurse scheduling problem
Proceedings of the 12th annual conference on Genetic and evolutionary computation
New computational results for the nurse scheduling problem: a scatter search algorithm
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
A hierarchical goal programming model for scheduling the outpatient clinics
Expert Systems with Applications: An International Journal
| Hi-index | 0.00 |
Since the nurse scheduling problem (NSP) is a problem of finding a feasible solution, the solution space must include infeasible solutions to solve it using a local search algorithm. However, the solution space consisting of all the solutions is so large that the search requires much CPU time. In the NSP, some constraints have higher priority. Thus, we can define the solution space to be the set of solutions satisfying some of the important constraints, which are called the elementary constraints. The connectivity of the solution space is also important for the performance. However, the connectivity is not obvious when the solution space consists only of solutions satisfying the elementary constraints and is composed of small neighborhoods. This paper gives theoretical support for using 4-opt-type neighborhood operations by discussing the connectivity of its solution space and the size of the neighborhood. Another interesting point in our model is a special case of the NSP corresponds to the bipartite transportation problem, and our result also applies to it.