The task assignment problem for unrestricted movement between workstation groups
type: Item
instance of: scholarly article
title: The task assignment problem for unrestricted movement between workstation groups
zbMATH Open document ID: 1154.90411
author: Jonathan F. Bard
author: Lin Wan
published in: Journal of Scheduling
publication date: 2007-05-15T00:00:00Z
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5153368
zbMATH Keywords: Multi-commodity network
zbMATH Keywords: Integer programming
zbMATH Keywords: Tabu search
zbMATH Keywords: Task assignment problem
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: s10951-006-7038-7
OpenAlex ID: W2094319004
cites work: The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm
cites work: Optimal Shift Scheduling with Multiple Break Windows
cites work: Staff scheduling at the United States postal Service
cites work: Scheduling Workforce and Workflow in a High Volume Factory
cites work: Personnel tour scheduling when starting-time restrictions are present
cites work: The state of the art of nurse rostering
cites work: Development and evaluation of an assignment heuristic for allocating cross-trained workers
cites work: Nurse rostering problems -- a bibliographic survey.
cites work: Staff scheduling and rostering: a review of applications, methods and models.
cites work: An enhanced rostering model for airline crews
cites work: Q4198056
cites work: Solving Large-Scale Tour Scheduling Problems
cites work: Staffing and allocation of workers in an administrative office
cites work: Lagrangian heuristics for instructor scheduling in executive development programmes
cites work: Improving Discrete Model Representations via Symmetry Considerations
DOI: 10.1007/S10951-006-7038-7
description: scientific article; zbMATH DE number 5153368