logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

An efficient two-phase algorithm for cyclic days-off scheduling

delete1998-11-01
delete46
PRE
AI
H
Hesham K. Alfares *
DOI：10.1016/S0305-0548(98)00033-1delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
An efficient two-phase algorithm is presented for serving the cyclic manpower days-off scheduling problem with two consecutive off days per week. First, a simple formula is used to calculate the minimum workforce size. Next, this minimum is incorporated as a constraint in a continuous linear programming (LP) model of the problem, ensuring an optimum integer solution. The new algorithm can handle the case in which the costs of different days-off patterns are not equal. Computational experience with 1250 test problems shows this algorithm to be significantly more efficient than other available solution methods. (C) 1998 Elsevier Science Ltd. All rights reserved.
Keywords:
labor scheduling
integer programming
optimization algorithms
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

C
Computers and Operations Research
IF:
4.3
Papers:
6.5K
Citations:
1.8W

Organization

No organization information available