{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T11:56:37Z","timestamp":1775562997036,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,1,3]],"date-time":"2021-01-03T00:00:00Z","timestamp":1609632000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,3]],"date-time":"2021-01-03T00:00:00Z","timestamp":1609632000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s10951-020-00674-3","type":"journal-article","created":{"date-parts":[[2021,1,3]],"date-time":"2021-01-03T18:02:30Z","timestamp":1609696950000},"page":"83-102","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Complexity and algorithms for min cost and max profit scheduling under time-of-use electricity tariffs"],"prefix":"10.1007","volume":"24","author":[{"given":"Michal","family":"Penn","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5960-2386","authenticated-orcid":false,"given":"Tal","family":"Raviv","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,3]]},"reference":[{"key":"674_CR1","doi-asserted-by":"publisher","first-page":"100105","DOI":"10.1016\/j.orp.2019.100105","volume":"6","author":"M Aghelinejad","year":"2019","unstructured":"Aghelinejad, M., Ouazene, Y., & Yalaoui, A. (2019). Complexity analysis of energy-efficient single machine scheduling problems. Operations Research Perspectives, 6, 100105.","journal-title":"Operations Research Perspectives"},{"key":"674_CR2","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1016\/j.orl.2008.01.011","volume":"36","author":"U Brenner","year":"2008","unstructured":"Brenner, U. (2008). A faster polynomial algorithm for the unbalanced Hitchcock transportation problem. Operations Research Letters, 36, 408\u2013413.","journal-title":"Operations Research Letters"},{"key":"674_CR3","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.cor.2017.04.004","volume":"85","author":"A Che","year":"2017","unstructured":"Che, A., Wu, X., Peng, J., & Yan, P. (2017). Energy-efficient bi-objective single-machine scheduling with power-down mechanism. Computers & Operations Research, 85, 172\u2013183.","journal-title":"Computers & Operations Research"},{"key":"674_CR4","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1016\/j.jclepro.2016.03.150","volume":"129","author":"A Che","year":"2016","unstructured":"Che, A., Zeng, Y., & Lyu, K. (2016). An efficient greedy insertion heuristic for energy-conscious single machine scheduling problem under time-of-use electricity tariffs. Journal of Cleaner Production, 129, 565\u2013577.","journal-title":"Journal of Cleaner Production"},{"issue":"3","key":"674_CR5","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1016\/j.ejor.2018.11.002","volume":"274","author":"B Chen","year":"2019","unstructured":"Chen, B., & Zhang, X. (2019). Scheduling with time-of-use costs. European Journal of Operational Research, 274(3), 900\u2013908.","journal-title":"European Journal of Operational Research"},{"key":"674_CR6","unstructured":"Fang, K. (2013). Algorithmic and mathematical programming approaches to scheduling problems with energy-based objectives, Ph.D. dissertation, Purdue University, ProQuest Dissertations Publishing, 2013. 3613120."},{"issue":"1\u20132","key":"674_CR7","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s10479-015-2003-5","volume":"238","author":"K Fang","year":"2016","unstructured":"Fang, K., Uhan, N. A., Zhao, F., & Sutherland, J. W. (2016). Scheduling on a single machine under time-of-use electricity tariffs. Annals of Operations Research, 238(1\u20132), 199\u2013227.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"674_CR8","doi-asserted-by":"publisher","first-page":"744","DOI":"10.1016\/j.ejor.2015.07.017","volume":"248","author":"C Gahm","year":"2016","unstructured":"Gahm, C., Denz, F., Dirr, M., & Tuma, A. (2016). Energy-efficient scheduling in manufacturing companies: A review and research framework. European Journal of Operational Research, 248(3), 744\u2013757.","journal-title":"European Journal of Operational Research"},{"key":"674_CR11","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"3","author":"RL Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 3, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"674_CR12","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computations","author":"R Karp","year":"1972","unstructured":"Karp, R. (1972). Reducibility among combinatorial problems. In R. E. Miller & J. W. Thatcher (Eds.), Complexity of computer computations (pp. 85\u2013103). NY: Plenum Press."},{"key":"674_CR13","unstructured":"Rubaiee, S., Cinar, S., & Yildirim, M. B. (2018). An energy-aware multiobjective optimization framework to minimize total tardiness and energy cost on a single-machine nonpreemptive scheduling. IEEE Transactions on Engineering Management (Early access)."},{"key":"674_CR14","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.jclepro.2013.12.024","volume":"67","author":"F Shrouf","year":"2014","unstructured":"Shrouf, F., Ordieres-Mer\u00e9, J., Garc\u00eda-S\u00e1nchez, A., & Ortega-Mier, M. (2014). Optimizing the production scheduling of a single machine to minimize total energy consumption costs. Journal of Cleaner Production, 67, 197\u2013207.","journal-title":"Journal of Cleaner Production"},{"key":"674_CR15","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1002\/nav.20393","volume":"57","author":"G Wan","year":"2010","unstructured":"Wan, G., & Qi, X. (2010). Scheduling with variable time slot costs. Naval Research Logistics, 57, 159\u2013171.","journal-title":"Naval Research Logistics"},{"key":"674_CR16","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1007\/s10951-015-0462-9","volume":"19","author":"Y Zhao","year":"2016","unstructured":"Zhao, Y., Qi, X., & Minming, L. (2016). On scheduling with non-increasing time slot cost to minimize total weighted completion time. Journal of Scheduling, 19, 759\u2013767.","journal-title":"Journal of Scheduling"},{"key":"674_CR17","first-page":"678","volume-title":"A single machine scheduling problem with time slot costs. Recent advances in computer science and information engineering","author":"W Zhong","year":"2012","unstructured":"Zhong, W., & Liu, X. (2012). A single machine scheduling problem with time slot costs. Recent advances in computer science and information engineering (pp. 678\u2013681). Heidelberg: Springer."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-020-00674-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-020-00674-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-020-00674-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,27]],"date-time":"2021-02-27T12:22:14Z","timestamp":1614428534000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-020-00674-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,3]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["674"],"URL":"https:\/\/doi.org\/10.1007\/s10951-020-00674-3","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,3]]},"assertion":[{"value":"22 October 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}