scientific article; zbMATH DE number 2080236

zbMath1044.90509MaRDI QIDQ4472481

Takayuki Osogami, Hiroshi Imai

Publication date: 4 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1969/19690072.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

Polynomially solvable personnel rostering problems ⋮ A two-phase adaptive variable neighborhood approach for nurse rostering ⋮ A multistage approach for an employee timetabling problem with a high diversity of shifts as a solution for a strongly varying workforce demand ⋮ Complexity results for the basic residency scheduling problem ⋮ Scheduling Security Personnel for the Vancouver 2010 Winter Olympic Games ⋮ A heuristic algorithm based on multi-assignment procedures for nurse scheduling ⋮ The first international nurse rostering competition 2010 ⋮ Simulated annealing approach to nurse rostering benchmark and real-world instances ⋮ Solving shift scheduling problem with days-off preference for power station workers using binary integer goal programming model ⋮ Comparison and hybridization of crossover operators for the nurse scheduling problem ⋮ Finding good nurse duty schedules: a case study ⋮ A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems ⋮ Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem ⋮ A scenario-based robust optimization with a pessimistic approach for nurse rostering problem ⋮ On the characterization and generation of nurse scheduling problem instances