Two-level decomposition algorithm for shift scheduling problems

Tsubasa Doi; Tatsushi Nishi

doi:10.1109/SMC.2014.6974518

Two-level decomposition algorithm for shift scheduling problems

Tsubasa Doi, Tatsushi Nishi

Research output: Contribution to journal › Conference article › peer-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 language	English
Article number	6974518
Pages (from-to)	3773-3778
Number of pages	6
Journal	Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics
Volume	2014-January
Issue number	January
DOIs	https://doi.org/10.1109/SMC.2014.6974518
Publication status	Published - 2014
Externally published	Yes
Event	2014 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2014 - San Diego, United States Duration: Oct 5 2014 → Oct 8 2014

ASJC Scopus subject areas

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

Access to Document

10.1109/SMC.2014.6974518

Cite this

@article{51b8caf64f50413383fae045b32042e2,

title = "Two-level decomposition algorithm for shift scheduling problems",

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.",

author = "Tsubasa Doi and Tatsushi Nishi",

year = "2014",

doi = "10.1109/SMC.2014.6974518",

language = "English",

volume = "2014-January",

pages = "3773--3778",

journal = "Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics",

issn = "1062-922X",

number = "January",

note = "2014 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2014 ; Conference date: 05-10-2014 Through 08-10-2014",

}

TY - JOUR

T1 - Two-level decomposition algorithm for shift scheduling problems

AU - Doi, Tsubasa

AU - Nishi, Tatsushi

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84938073056&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84938073056&partnerID=8YFLogxK

U2 - 10.1109/SMC.2014.6974518

DO - 10.1109/SMC.2014.6974518

M3 - Conference article

AN - SCOPUS:84938073056

SN - 1062-922X

VL - 2014-January

SP - 3773

EP - 3778

JO - Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

JF - Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

IS - January

M1 - 6974518

T2 - 2014 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2014

Y2 - 5 October 2014 through 8 October 2014

ER -

Two-level decomposition algorithm for shift scheduling problems

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this