Citation
Bilevel Decomposition Approach for Cyclic Staff Scheduling Problems. In proceedings of the 6th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2013), 27 - 30 Aug 2013, Ghent, Belgium, pages 65-79, 2013.
Paper
Abstract
In this paper, a bilevel decomposition approach for cyclic sta? scheduling problem is presented. A cyclic sta? scheduling problem is to create a set of cyclic schedule with several workforce regulations. The objective is to minimize the weighted sum of the total days and the deviation from average working time for fair working condition. The original problem is decomposed into the master problem and the subproblems for each cyclic schedule. The master problem formulated as an unrelated parallel machine scheduling problem to minimize makespan is solved by an e?cient branch and bound algorithm. The cuts are added to improve the lower bound. The proposed approach is applied to a railway crew rostering problem. The performance of the proposed method is compared with the general-purpose solvers with the constraint programming method. Computational results show the e?ectiveness of the proposed method with small duality gap.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2013-065-079-P, author = {T. Nishi and T. Sugiyama},
title = {Bilevel Decomposition Approach for Cyclic Staff Scheduling Problems},
booktitle = {In proceedings of the 6th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2013), 27 - 30 Aug 2013, Ghent, Belgium},
year = {2013},
editor = {G. Kendall and B. McCollum and G. {Venden Berghe}},
pages = {65--79},
note = {Paper},
abstract = { In this paper, a bilevel decomposition approach for cyclic sta? scheduling problem is presented. A cyclic sta? scheduling problem is to create a set of cyclic schedule with several workforce regulations. The objective is to minimize the weighted sum of the total days and the deviation from average working time for fair working condition. The original problem is decomposed into the master problem and the subproblems for each cyclic schedule. The master problem formulated as an unrelated parallel machine scheduling problem to minimize makespan is solved by an e?cient branch and bound algorithm. The cuts are added to improve the lower bound. The proposed approach is applied to a railway crew rostering problem. The performance of the proposed method is compared with the general-purpose solvers with the constraint programming method. Computational results show the e?ectiveness of the proposed method with small duality gap.},
owner = {Graham},
timestamp = {2017.01.16},
webpdf = {2013-065-079-P.pdf} }