{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:08:09Z","timestamp":1742915289099,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031203497"},{"type":"electronic","value":"9783031203503"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-20350-3_3","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"21-31","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Time-of-Use Scheduling Problem with\u00a0Equal-Length Jobs"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Chau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenchen","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Lyu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weiwei","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yizheng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"issue":"4","key":"3_CR1","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0167-6377(98)00045-5","volume":"24","author":"P Baptiste","year":"1999","unstructured":"Baptiste, P.: An o( n$$^{{4}}$$) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Oper. Res. Lett. 24(4), 175\u2013180 (1999)","journal-title":"Oper. Res. Lett."},{"issue":"6","key":"3_CR2","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1002\/(SICI)1099-1425(199911\/12)2:6<245::AID-JOS28>3.0.CO;2-5","volume":"2","author":"P Baptiste","year":"1999","unstructured":"Baptiste, P.: Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times. J. Scheduling 2(6), 245\u2013252 (1999)","journal-title":"J. Scheduling"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Baptiste, P., Brucker, P., Knust, S., Timkovsky, V.G.: Ten notes on equal-processing-time scheduling. 4OR 2(2), 111\u2013127 (2004)","DOI":"10.1007\/s10288-003-0024-4"},{"issue":"3","key":"3_CR4","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.orl.2003.09.004","volume":"32","author":"P Baptiste","year":"2004","unstructured":"Baptiste, P., Chrobak, M., D\u00fcrr, C., Jawor, W., Vakhania, N.: Preemptive scheduling of equal-length jobs to maximize weighted throughput. Oper. Res. Lett. 32(3), 258\u2013264 (2004)","journal-title":"Oper. Res. Lett."},{"key":"3_CR5","volume-title":"Scheduling Algorithms","author":"P Brucker","year":"2010","unstructured":"Brucker, P.: Scheduling Algorithms, 5th edn. Springer Publishing Company, Incorporated (2010)","edition":"5"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Chawla, S., Devanur, N.R., Holroyd, A.E., Karlin, A.R., Martin, J.B., Sivan, B.: Stability of service under time-of-use pricing. In: Hatami, H., McKenzie, P., King, V. (eds.) Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19\u201323, 2017, pp. 184\u2013197. ACM (2017)","DOI":"10.1145\/3055399.3055455"},{"issue":"3","key":"3_CR7","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.: Scheduling with time-of-use costs. Eur. J. Oper. Res. 274(3), 900\u2013908 (2019)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"3_CR8","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10479-021-03983-8","volume":"304","author":"L Chen","year":"2021","unstructured":"Chen, L., Megow, N., Rischke, R., Stougie, L., Verschae, J.: Optimal algorithms for scheduling under time-of-use tariffs. Ann. Oper. Res. 304(1), 85\u2013107 (2021)","journal-title":"Ann. Oper. Res."},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Kan, A.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Annal. Discrete Math. 5, 287\u2013326 (1979)","journal-title":"Annal. Discrete Math."},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-642-38016-7_17","volume-title":"Approximation and Online Algorithms","author":"J Kulkarni","year":"2013","unstructured":"Kulkarni, J., Munagala, K.: Algorithms for cost-aware scheduling. In: Erlebach, T., Persiano, G. (eds.) WAOA 2012. LNCS, vol. 7846, pp. 201\u2013214. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38016-7_17"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Lawler, E.: A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs, vol. 26, pp. 125\u2013133. Baltzer Science Publishers, Baarn\/Kluwer Academic Publishers (1990)","DOI":"10.1007\/BF02248588"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Lawler, E.: Knapsack-like scheduling problems, the moore-hodgson algorithm and the \u2018tower of sets\u2019 property, vol. 20, pp. 91\u2013106 (1994)","DOI":"10.1016\/0895-7177(94)90209-7"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Moore, J.M.: An n job, one machine sequencing algorithm for minimizing the number of late jobs, vol. 15, pp. 102\u2013109, September 1968","DOI":"10.1287\/mnsc.15.1.102"},{"issue":"1","key":"3_CR14","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10951-020-00674-3","volume":"24","author":"M Penn","year":"2021","unstructured":"Penn, M., Raviv, T.: Complexity and algorithms for min cost and max profit scheduling under time-of-use electricity tariffs. J. Sched. 24(1), 83\u2013102 (2021)","journal-title":"J. Sched."},{"issue":"2","key":"3_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.: Scheduling with variable time slot costs. Naval Res. Logist. (NRL) 57(2), 159\u2013171 (2010)","journal-title":"Naval Res. Logist. (NRL)"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2020.03.018","volume":"821","author":"K Wang","year":"2020","unstructured":"Wang, K.: Calibration scheduling with time slot cost. Theor. Comput. Sci. 821, 1\u201314 (2020)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"3_CR17","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., Li, M.: On scheduling with non-increasing time slot cost to minimize total weighted completion time. J. Sched. 19(6), 759\u2013767 (2016)","journal-title":"J. Sched."},{"key":"3_CR18","series-title":"Lecture Notes in Electrical Engineering","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/978-3-642-25766-7_90","volume-title":"Recent Advances in Computer Science and Information Engineering","author":"W Zhong","year":"2012","unstructured":"Zhong, W., Liu, X.: A single machine scheduling problem with time slot costs. In: Qian, Z., Cao, L., Su, W., Wang, T., Yang, H. (eds.) Recent Advances in Computer Science and Information Engineering. Lecture Notes in Electrical Engineering, vol. 126, pp. 677\u2013681. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20350-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:20:32Z","timestamp":1672550432000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20350-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031203497","9783031203503"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20350-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAMC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Models of Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tamc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lxy.tjut.edu.cn\/TAMC2022.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}