NDLI: The task assignment problem for unrestricted movement between workstation groups

Please wait, while we are loading the content...

The task assignment problem for unrestricted movement between workstation groups

Content Provider	Springer Nature Link
Author	Bard, Jonathan F. Wan, Lin
Copyright Year	2006
Abstract	The purpose of this paper is to investigate the problem of assigning tasks to workers during their daily shifts. For a homogeneous workforce, a given set of workstation groups, and a corresponding demand for labor, the objective is to develop a disaggregated schedule for each worker that minimizes the weighted sum of transitions between workstation groups. In the formulation of the problem, each day is divided into 48 1/2-hour time periods and a multi-commodity network is constructed in which each worker corresponds to a unique commodity and each node represents a workstation group-time period combination. Lunch breaks and idle time are also included in the model.Initial attempts to solve large instances with a commercial code indicated a need for a more practical approach. This led to the development of a reduced network representation in which idle periods are treated implicitly, and a sequential methodology in which the week is decomposed into 7 daily problems and each solved in turn. To gain more computational efficiency, a tabu search procedure was also developed.All procedures were tested using data obtained from a U.S. Postal Service mail processing and distribution center. Depending on the labor category, anywhere from 3 to 28 workstation groups and up to 311 full-time and part-time workers had to be scheduled together. The results were mixed. While small problems could be solved to near-optimality with the integer programming approaches, tabu search was the best alternative for the very large instances. However, the excessive number of swaps needed to gain marginal improvements, undermined its effectiveness.Combining the two provided a good balance in most cases.
Starting Page	315
Ending Page	341
Page Count	27
File Format	PDF
ISSN	10946136
Journal	Journal of Scheduling
Volume Number	9
Issue Number	4
e-ISSN	10991425
Language	English
Publisher	Kluwer Academic Publishers
Publisher Date	2006-01-01
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Multi-commodity network Integer programming Tabu search Task assignment problem Artificial Intelligence (incl. Robotics) Optimization Calculus of Variations and Optimal Control Operations Research/Decision Theory Production/Logistics
Content Type	Text
Resource Type	Article
Subject	Artificial Intelligence Management Science and Operations Research Engineering Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A tabu search heuristic for the quay crane scheduling problem

School timetabling for quality student and teacher schedules

Tabu search techniques for the heterogeneous vehicle routing problem with time windows and carrier-dependent costs

Local search heuristics for the multidimensional assignment problem

Tabu Search Algorithms for Cyclic Machine Scheduling Problems

An Advanced Tabu Search Algorithm for the Job Shop Problem

Solution of the Cumulative Assignment Problem With a Well-Structured Tabu Search Method

The traveling tournament problem with predefined venues

A hybrid genetic algorithm and tabu search approach for post enrolment course timetabling

The task assignment problem for unrestricted movement between workstation groups

Similar Documents

A tabu search heuristic for the quay crane scheduling problem

School timetabling for quality student and teacher schedules

Tabu search techniques for the heterogeneous vehicle routing problem with time windows and carrier-dependent costs

Local search heuristics for the multidimensional assignment problem

Tabu Search Algorithms for Cyclic Machine Scheduling Problems

An Advanced Tabu Search Algorithm for the Job Shop Problem

Solution of the Cumulative Assignment Problem With a Well-Structured Tabu Search Method

The traveling tournament problem with predefined venues

A hybrid genetic algorithm and tabu search approach for post enrolment course timetabling

The task assignment problem for unrestricted movement between workstation groups