{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T22:58:29Z","timestamp":1771023509734,"version":"3.50.1"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1109\/smc.2017.8123072","type":"proceedings-article","created":{"date-parts":[[2017,11,30]],"date-time":"2017-11-30T22:22:47Z","timestamp":1512080567000},"page":"2927-2932","source":"Crossref","is-referenced-by-count":4,"title":["Scheduling jobs with multitasking and asymmetric switching costs"],"prefix":"10.1109","author":[{"given":"Kevin I.-J.","family":"Ho","sequence":"first","affiliation":[]},{"given":"John","family":"Sum","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1037\/\/0096-1523.27.4.763"},{"key":"ref11","author":"garey","year":"1979","journal-title":"Computers and intractability A guide to the theory of NP-complete ness"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70323-6"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1287\/opre.26.1.22"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1287\/opre.30.2.391"},{"key":"ref16","article-title":"Combinatorial Optimization: Algorithms and Complexity","author":"papadimitriou","year":"1982","journal-title":"Courier Corporation"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1002\/cne.920180503"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00066-1"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2016.1208852"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.05.040"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(98)00246-X"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1111\/poms.12331"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.apm.2009.07.002"},{"key":"ref8","article-title":"Operations scheduling in the presence of multitasking and symmetric switching cost","author":"sum","year":"2015","journal-title":"Proceedings of International Conference on Management Science and Decision Making"},{"key":"ref7","author":"pinedo","year":"2015","journal-title":"Scheduling Theory Algorithms and Systems"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(93)90175-9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ergon.2008.05.001"},{"key":"ref9","year":"2006","journal-title":"Multitasking Switching Costs"},{"key":"ref20","article-title":"A note on multitasking scheduling problems with deterioration effect","author":"zhu","year":"2006","journal-title":"Mathematical Problems in Engineering"}],"event":{"name":"2017 IEEE International Conference on Systems, Man and Cybernetics (SMC)","location":"Banff, AB","start":{"date-parts":[[2017,10,5]]},"end":{"date-parts":[[2017,10,8]]}},"container-title":["2017 IEEE International Conference on Systems, Man, and Cybernetics (SMC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8114675\/8122565\/08123072.pdf?arnumber=8123072","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,1,17]],"date-time":"2018-01-17T23:15:10Z","timestamp":1516230910000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8123072\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/smc.2017.8123072","relation":{},"subject":[],"published":{"date-parts":[[2017,10]]}}}