Two-level decomposition algorithm for shift scheduling problems

Tsubasa Doi, Tatsushi Nishi

Research output: Contribution to journalConference articlepeer-review

3 Citations (Scopus)

Abstract

We propose a new two-level decomposition algorithm for shift scheduling problems. The problem determines the assignment of duties and rest days to the set of staff members to minimize the given objective function. The constraint on the set of staff members are considered. The objective of this paper is to achieve the minimization of total costs with fairness of working conditions. The proposed method decomposes the original problem into the master and the subproblems. These subproblems are iteratively solved with embedding cuts into the master problem. Computational results show that the performance of the proposed method outperforms a generalpurpose constraint logic programming solver.

Original languageEnglish
Article number6974518
Pages (from-to)3773-3778
Number of pages6
JournalConference Proceedings - IEEE International Conference on Systems, Man and Cybernetics
Volume2014-January
Issue numberJanuary
DOIs
Publication statusPublished - 2014
Externally publishedYes
Event2014 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2014 - San Diego, United States
Duration: Oct 5 2014Oct 8 2014

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Control and Systems Engineering
  • Human-Computer Interaction

Fingerprint Dive into the research topics of 'Two-level decomposition algorithm for shift scheduling problems'. Together they form a unique fingerprint.

Cite this