{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:44:59Z","timestamp":1747579499932},"reference-count":24,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[1996,8]]},"DOI":"10.1016\/0305-0548(95)00073-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:00:05Z","timestamp":1027638005000},"page":"819-828","source":"Crossref","is-referenced-by-count":18,"title":["A binary-rounding heuristic for multi-period variable-task-duration assignment problems"],"prefix":"10.1016","volume":"23","author":[{"given":"Janis L.","family":"Miller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lori S.","family":"Franz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(95)00073-9_BIB1","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1111\/j.1540-5915.1988.tb00269.x","article-title":"Multidimensional assignment problems","volume":"19","author":"Gilbert","year":"1988","journal-title":"Decis. Sci."},{"key":"10.1016\/0305-0548(95)00073-9_BIB2","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1287\/mnsc.25.7.683","article-title":"Weighted assignment models and their application","volume":"25","author":"Ross","year":"1979","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(95)00073-9_BIB3","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/0377-2217(86)90302-4","article-title":"The multiperiod assignment problem: a multicommodity network flow model and specialized branch and bound algorithm","volume":"9","author":"Aronson","year":"1986","journal-title":"Eur. J. Opl Res."},{"key":"10.1016\/0305-0548(95)00073-9_BIB4","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1287\/mnsc.37.6.695","article-title":"Algorithms for the multi-resource generalized assignment problem","volume":"37","author":"Gavish","year":"1991","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(95)00073-9_BIB5","doi-asserted-by":"crossref","first-page":"1372","DOI":"10.1287\/mnsc.22.12.1372","article-title":"Heuristic methods for telephone operator shift scheduling: an experimental analysis","volume":"22","author":"Henderson","year":"1976","journal-title":"Mgmt Sci."},{"issue":"1","key":"10.1016\/0305-0548(95)00073-9_BIB6","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1111\/j.1540-5915.1987.tb01505.x","article-title":"A methodology for labor scheduling in a service operating system","volume":"18","author":"Bechtold","year":"1987","journal-title":"Decis. Sci."},{"doi-asserted-by":"crossref","unstructured":"E. S. Rosenbloom and N. F. Goertzen, Cyclic nurse scheduling. Eur. J. Opl Res. 31(1), 19\u201323.","key":"10.1016\/0305-0548(95)00073-9_BIB7","DOI":"10.1016\/0377-2217(87)90131-7"},{"key":"10.1016\/0305-0548(95)00073-9_BIB8","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0377-2217(89)90249-X","article-title":"A mathematical model for scheduling and staffing multiclinic health regions","volume":"41","author":"Franz","year":"1989","journal-title":"Eur. J. Opl Res."},{"key":"10.1016\/0305-0548(95)00073-9_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/inte.10.2.1","article-title":"Shift scheduling in banking operations: a case application","volume":"10","author":"Krajewski","year":"1980","journal-title":"Interfaces"},{"issue":"7","key":"10.1016\/0305-0548(95)00073-9_BIB10","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1108\/eb054849","article-title":"An evaluation of a full\/part-time tour scheduling methodology","volume":"8","author":"Showalter","year":"1988","journal-title":"Int. J. Opns and Production Mgmt"},{"key":"10.1016\/0305-0548(95)00073-9_BIB11","doi-asserted-by":"crossref","first-page":"942","DOI":"10.1287\/mnsc.29.8.942","article-title":"Simple approaches to shift, days-off and tour scheduling problems","volume":"29","author":"Morris","year":"1983","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(95)00073-9_BIB12","doi-asserted-by":"crossref","first-page":"1057","DOI":"10.1057\/palgrave.jors.0391110","article-title":"A quick heuristic for some cyclic staffing problems with breaks","volume":"39","author":"Vohra","year":"1988","journal-title":"J. Opl Res. Soc."},{"key":"10.1016\/0305-0548(95)00073-9_BIB13","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1287\/opre.34.4.560","article-title":"Resource-constrained assignment scheduling","volume":"34","author":"Mazzola","year":"1986","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(95)00073-9_BIB14","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0377-2217(85)90167-5","article-title":"An introduction to timetabling","volume":"19","author":"de Werra","year":"1985","journal-title":"Eur. J. Opl Res."},{"key":"10.1016\/0305-0548(95)00073-9_BIB15","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1287\/opre.31.5.803","article-title":"Solving large-scale zero-one linear programming problems","volume":"31","author":"Crowder","year":"1983","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(95)00073-9_BIB16","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1016\/0377-2217(86)90042-1","article-title":"Heuristics and reduction methods for multiple constraints 0\u20131 linear programming problems","volume":"24","author":"Freville","year":"1986","journal-title":"Eur. J. Opl Res."},{"issue":"1","key":"10.1016\/0305-0548(95)00073-9_BIB17","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1287\/mnsc.24.1.91","article-title":"Heuristic 0\u20131 linear programming: an experimental comparison of three methods","volume":"24","author":"Zanakis","year":"1977","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(95)00073-9_BIB18","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0272-6963(84)90027-5","article-title":"A heuristic programming approach to the employee scheduling problem and some thoughts on managerial robots","volume":"4","author":"Glover","year":"1984","journal-title":"J. of Opns Mgmt"},{"key":"10.1016\/0305-0548(95)00073-9_BIB19","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1287\/opre.29.3.501","article-title":"A guaranteed-accuracy round-off algorithm for cyclic scheduling and set covering","volume":"29","author":"Bartholdi","year":"1981","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(95)00073-9_BIB20","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1287\/mnsc.38.2.263","article-title":"A heuristic ceiling point algorithm for general integer linear programming","volume":"38","author":"Saltzman","year":"1992","journal-title":"Mgmt Sci."},{"issue":"2","key":"10.1016\/0305-0548(95)00073-9_BIB21","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1111\/j.1540-5915.1975.tb01014.x","article-title":"Pitfalls of rounding in discrete management decision problems","volume":"6","author":"Glover","year":"1975","journal-title":"Decis. Sci."},{"year":"1975","author":"Taha","series-title":"Integer Programming Theory, Applications, and Computations","key":"10.1016\/0305-0548(95)00073-9_BIB22"},{"key":"10.1016\/0305-0548(95)00073-9_BIB23","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1287\/opre.35.6.832","article-title":"Solving multi-item capacitated lot-sizing problems using variable redefinition","volume":"35","author":"Eppen","year":"1987","journal-title":"Opns Res."},{"key":"10.1016\/0305-0548(95)00073-9_BIB24","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1287\/opre.41.2.269","article-title":"Scheduling medical residents to rotations: solving the large scale multiperiod staff assignment problem","volume":"41","author":"Franz","year":"1993","journal-title":"Opns Res."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054895000739?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054895000739?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T01:26:12Z","timestamp":1580865972000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054895000739"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":24,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["0305054895000739"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(95)00073-9","relation":{},"ISSN":["0305-0548"],"issn-type":[{"type":"print","value":"0305-0548"}],"subject":[],"published":{"date-parts":[[1996,8]]}}}