{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T04:14:28Z","timestamp":1777090468659,"version":"3.51.4"},"reference-count":20,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4125,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2002,4]]},"DOI":"10.1016\/s0166-218x(01)00258-x","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T15:12:20Z","timestamp":1034608340000},"page":"85-98","source":"Crossref","is-referenced-by-count":37,"title":["Efficient generation of rotating workforce schedules"],"prefix":"10.1016","volume":"118","author":[{"given":"Nysret","family":"Musliu","sequence":"first","affiliation":[]},{"given":"Johannes","family":"G\u00e4rtner","sequence":"additional","affiliation":[]},{"given":"Wolfgang","family":"Slany","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00258-X_BIB1","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1002\/net.3230200103","article-title":"A network model for the rotating workforce scheduling problem","volume":"20","author":"Balakrishnan","year":"1990","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(01)00258-X_BIB2","unstructured":"BEST, Guidelines for shiftworkers, Bulletin of European Time Studies No. 3, European Foundation for the Improvement of Living and Working Conditions, 1991."},{"key":"10.1016\/S0166-218X(01)00258-X_BIB3","unstructured":"B. Butler, Computerized manpower scheduling, Master's Thesis, University of Alberta, Canada, 1978."},{"key":"10.1016\/S0166-218X(01)00258-X_BIB4","unstructured":"J. G\u00e4rtner, M. Kundi, S. Wahl, K. H\u00f6rwein, M. Janke, H. Conrad, I. Carlberg, G. Herber, J. Vo\u00df, Handbuch Schichtpl\u00e4ne: Planungstechnik, Entwicklung, Ergonomie, Umfeld. vdf, Hochschulverlag AG an der ETH Z\u00fcrich, 1998."},{"key":"10.1016\/S0166-218X(01)00258-X_BIB5","series-title":"Influence of law on shift schedule design: USA and Europe, XIV International Symposium on Night and Shiftwork","author":"G\u00e4rtner","year":"1999"},{"issue":"5","key":"10.1016\/S0166-218X(01)00258-X_BIB6","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/0305-0548(86)90050-X","article-title":"The general employee scheduling problem: an integration of MS and AI","volume":"13","author":"Glover","year":"1986","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00258-X_BIB7","unstructured":"N. Heller, J. McEwen, W. Stenzel, Computerized scheduling of police manpower, St. Louis Police Department, St. Louis, MO, 1973."},{"key":"10.1016\/S0166-218X(01)00258-X_BIB8","doi-asserted-by":"crossref","unstructured":"R. Hung, A three-day workweek multiple-shift scheduling model, J. Oper. Res. Soc. (44) (1993) 141\u2013146.","DOI":"10.1057\/jors.1993.26"},{"key":"10.1016\/S0166-218X(01)00258-X_BIB9","doi-asserted-by":"crossref","unstructured":"R. Hung, A multiple-shift workforce scheduling model under 4-day workweek with weekday and weekend labour demands, J. Oper. Res. Soc. (45) (1994) 1088\u20131092.","DOI":"10.2307\/2584150"},{"key":"10.1016\/S0166-218X(01)00258-X_BIB10","doi-asserted-by":"crossref","unstructured":"P. Knauth, Designing better shift systems, Appl. Ergonom. (27) (1996) 39\u201344.","DOI":"10.1016\/0003-6870(95)00044-5"},{"key":"10.1016\/S0166-218X(01)00258-X_BIB11","unstructured":"L. Kragelund, T. Kabel, Employee timetabling, Master's Thesis, Department of Computer Science, University of Aarhus, Ny Munkegade, Building 540, DK-8000 Aarhus C, Denmark, 1998."},{"key":"10.1016\/S0166-218X(01)00258-X_BIB12","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1057\/palgrave.jors.2600803","article-title":"The art and science of designing rotating schedules","volume":"50","author":"Laporte","year":"1999","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/S0166-218X(01)00258-X_BIB13","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/0377-2217(80)90036-3","article-title":"Rotating schedules","volume":"4","author":"Laporte","year":"1980","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"10.1016\/S0166-218X(01)00258-X_BIB14","first-page":"88","article-title":"Combinatorial approaches for hard problems in manpower scheduling","volume":"39","author":"Chuin Lau","year":"1996","journal-title":"J. Oper. Res. Soc. Japan"},{"issue":"1","key":"10.1016\/S0166-218X(01)00258-X_BIB15","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0305-0548(94)00094-O","article-title":"On the complexity of manpower scheduling","volume":"23","author":"Chuin Lau","year":"1996","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00258-X_BIB16","unstructured":"N. Musliu, J. G\u00e4rtner, W. Slany, Efficient generation of rotating workforce schedules, Technical Report DBAI-TR-2000-35, Institut f\u00fcr Informationssysteme der Technischen Universit\u00e4t Wien, 2000. http:\/\/www.arXiv.org\/abs\/cs.OH\/0002018."},{"key":"10.1016\/S0166-218X(01)00258-X_BIB17","doi-asserted-by":"crossref","unstructured":"A. Schaerf, A. Meisels, Solving employee timetabling problems by generalized local search, in: Paper presented at AI\u2217IA\u201999, Bologna, Italy, 1999.","DOI":"10.1007\/3-540-46238-4_33"},{"key":"10.1016\/S0166-218X(01)00258-X_BIB18","doi-asserted-by":"crossref","unstructured":"B.M. Smith, S. Bennett, Combining constraint satisfaction and local improvement algorithms to construct anaesthetist's rotas, in: Proc. CAIA-92, 8th IEEE Conf. on Artificial Intelligence Applications, 1992, Monterey, CA, pp. 106\u2013112.","DOI":"10.1109\/CAIA.1992.200017"},{"issue":"3","key":"10.1016\/S0166-218X(01)00258-X_BIB19","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1137\/1024063","article-title":"On manpower scheduling algorithms","volume":"24","author":"Tien","year":"1982","journal-title":"SIAM Rev."},{"key":"10.1016\/S0166-218X(01)00258-X_BIB20","unstructured":"G. Weil, K. Heus, Eliminating interchangeable values in the nurse scheduling problem formulated as a constraint satisfaction problem, in: Paper Presented at the Workshop CONSTRAINT\u201995, Melbourne Beach, Florida, USA, 1995."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X0100258X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X0100258X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T17:45:35Z","timestamp":1733247935000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X0100258X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S0166218X0100258X"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00258-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}