NDLI: The minimum shift design problem

Content Provider	Springer Nature Link
Author	Di Gaspero, Luca Gärtner, Johannes Kortsarz, Guy Musliu, Nysret Schaerf, Andrea Slany, Wolfgang
Copyright Year	2007
Abstract	The min-Shift Design problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the number of employees to be assigned to these shifts in order to minimize the deviation from workforce requirements. Our research considers both theoretical and practical aspects of the min-Shift Design problem. This problem is closely related to the minimum edge-cost flow problem (MECF), a network flow variant that has many applications beyond shift scheduling. We show that MSD reduces to a special case of MECF and, exploiting this reduction, we prove a logarithmic hardness of approximation lower bound for MSD. On the basis of these results, we propose a hybrid heuristic for the problem, which relies on a greedy heuristic followed by a local search algorithm. The greedy part is based on the network flow analogy, and the local search algorithm makes use of multiple neighborhood relations. An experimental analysis on structured random instances shows that the hybrid heuristic clearly outperforms our previous commercial implementation. Furthermore, it highlights the respective merits of the composing heuristics for different performance parameters.
Starting Page	79
Ending Page	105
Page Count	27
File Format	PDF
ISSN	02545330
Journal	Annals of Operations Research
Volume Number	155
Issue Number	1
e-ISSN	15729338
Language	English
Publisher	Springer US
Publisher Date	2007-07-07
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Workforce scheduling Hybrid algorithms Local search Greedy heuristics Theory of Computation Combinatorics Operations Research/Decision Theory
Content Type	Text
Resource Type	Article
Subject	Management Science and Operations Research

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

Modeling and solving a real-life multi-skill shift design problem

Parallel hybrid heuristics for the permutation flow shop problem

RAMP for the capacitated minimum spanning tree problem

Bridging the gap between self schedules and feasible schedules in staff scheduling

Problem space search algorithms for resource-constrained project scheduling

Solving a chemical batch scheduling problem by local search

A constructive heuristic for staff scheduling in the glass industry

Hybrid constructive heuristics for the critical node problem

An effective greedy heuristic for the Social Golfer Problem

The minimum shift design problem

Similar Documents

Modeling and solving a real-life multi-skill shift design problem

Parallel hybrid heuristics for the permutation flow shop problem

RAMP for the capacitated minimum spanning tree problem

Bridging the gap between self schedules and feasible schedules in staff scheduling

Problem space search algorithms for resource-constrained project scheduling

Solving a chemical batch scheduling problem by local search

A constructive heuristic for staff scheduling in the glass industry

Hybrid constructive heuristics for the critical node problem

An effective greedy heuristic for the Social Golfer Problem

The minimum shift design problem