NDLI: Implicit shift scheduling with multiple breaks and work stretch duration restrictions

Content Provider	Springer Nature Link
Author	Rekik, Monia Cordeau, Jean François Soumis, François
Copyright Year	2009
Abstract	This paper considers a shift scheduling problem that includes different forms of flexibility in terms of shift starting times, break lengths and break placement. Two particular forms are studied: fractionable breaks and work stretch duration restrictions. Unlike standard breaks, fractionable breaks are not required to be attributed as a whole. They can be divided into fractions of breaks under some conditions. The distribution of breaks within a shift is done with respect to work stretch duration restrictions to ensure a correct mix of periods of work and rest. Two implicit models are proposed. They extend previous work on implicit modeling of break placement to incorporate the concepts of fractionable breaks and work stretch duration restrictions. In this context, we show the merits of using the so-called forward and backward constraints to model work stretch duration restrictions. We also introduce a new formulation of the forward and backward constraints and demonstrate that it considerably reduces the density of the constraint matrix of the two proposed models. Finally, we study the impact of fractionable breaks and work stretch duration restrictions and show that, for some instances, the use of these concepts considerably reduces the workforce size when compared to other traditional approaches.
Starting Page	49
Ending Page	75
Page Count	27
File Format	PDF
ISSN	10946136
Journal	Journal of Scheduling
Volume Number	13
Issue Number	1
e-ISSN	10991425
Language	English
Publisher	Springer US
Publisher Date	2009-07-07
Publisher Place	Boston
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Shift scheduling Flexibility Breaks Work stretch restrictions Forward and backward constraints Production/Logistics Artificial Intelligence (incl. Robotics) Optimization Calculus of Variations and Optimal Control; Optimization Operations Research/Decision Theory
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

Approximation Algorithms for Average Stretch Scheduling

Single-processor scheduling with time restrictions

Minimizing the stretch when scheduling flows of divisible requests

On a parallel machine scheduling problem with precedence constraints

Parallel machine scheduling with multiple unloading servers

Scheduling algorithms for procrastinators

A robust approach for the single machine scheduling problem

Flexible weekly tour scheduling for postal service workers using a branch and price

Time-constrained project scheduling

Implicit shift scheduling with multiple breaks and work stretch duration restrictions

Similar Documents

Approximation Algorithms for Average Stretch Scheduling

Single-processor scheduling with time restrictions

Minimizing the stretch when scheduling flows of divisible requests

On a parallel machine scheduling problem with precedence constraints

Parallel machine scheduling with multiple unloading servers

Scheduling algorithms for procrastinators

A robust approach for the single machine scheduling problem

Flexible weekly tour scheduling for postal service workers using a branch and price

Time-constrained project scheduling

Implicit shift scheduling with multiple breaks and work stretch duration restrictions