{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:59:05Z","timestamp":1743109145238,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":17,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811566479"},{"type":"electronic","value":"9789811566486"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-981-15-6648-6_25","type":"book-chapter","created":{"date-parts":[[2020,7,18]],"date-time":"2020-07-18T09:02:51Z","timestamp":1595062971000},"page":"317-328","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A New Approach to Solve Job Sequencing Problem Using Dynamic Programming with Reduced Time Complexity"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4980-9858","authenticated-orcid":false,"given":"Tanzin","family":"Ahammad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7274-3909","authenticated-orcid":false,"given":"Mahedi","family":"Hasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1972-3239","authenticated-orcid":false,"given":"Mohammad","family":"Hasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4545-6872","authenticated-orcid":false,"given":"Md.","family":"Sabir Hossain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0691-5108","authenticated-orcid":false,"given":"Ariful","family":"Hoque","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8953-5487","authenticated-orcid":false,"given":"Md Mamunur","family":"Rashid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,19]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0166-218X(81)90008-1","volume":"3","author":"GV Gens","year":"1981","unstructured":"Gens, G.V., Levner, E.V.: Fast approximation algorithm for job sequencing with deadlines. Discrete Appl. Math. 3, 313\u2013318 (1981)","journal-title":"Discrete Appl. Math."},{"doi-asserted-by":"publisher","unstructured":"Levner, E., Elalouf, A.: An improved approximation algorithm for the ancient scheduling problem with deadlines. In: Proceedings - 2014 International Conference on Control, Decision and Information Technologies, CoDIT 2014, 113\u2013116 (Institute of Electrical and Electronics Engineers Inc., 2014). https:\/\/doi.org\/10.1109\/codit.2014.6996878","key":"25_CR2","DOI":"10.1109\/codit.2014.6996878"},{"issue":"1","key":"25_CR3","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/321921.321934","volume":"23","author":"KS Sartaj","year":"1976","unstructured":"Sartaj, K.S.: Algorithms for scheduling independent tasks. J. ACM 23(1), 116\u2013127 (1976). https:\/\/doi.org\/10.1145\/321921.321934","journal-title":"J. ACM"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1108\/01443579610110503","volume":"16","author":"EOP Akpan","year":"1996","unstructured":"Akpan, E.O.P.: Job-shop sequencing problems via network scheduling technique. Int. J. Oper. Prod. Manage. 16, 76\u201386 (1996)","journal-title":"Int. J. Oper. Prod. Manage."},{"issue":"3","key":"25_CR5","doi-asserted-by":"publisher","first-page":"301","DOI":"10.5121\/ijdps.2012.3325","volume":"3","author":"PK Singh","year":"2012","unstructured":"Singh, P.K.: Path optimization algorithm for network problems using job sequencing technique. Int. J. Distrib. Parallel Syst. 3(3), 301\u2013309 (2012)","journal-title":"Int. J. Distrib. Parallel Syst."},{"issue":"1","key":"25_CR6","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/opre.26.1.36","volume":"26","author":"T Gonzalez","year":"1978","unstructured":"Gonzalez, T., Sahni, S.: Flowshop and jobshop schedules: complexity and approximation. Oper. Res. 26(1), 36\u201352 (1978)","journal-title":"Oper. Res."},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.swevo.2016.06.002","volume":"32","author":"J Deng","year":"2017","unstructured":"Deng, J., Wang, L.: A competitive memetic algorithm for multi-objective distributed permutation flow shop scheduling problem. Swarm. Evol Comput. 32, 121\u2013131 (2017)","journal-title":"Swarm. Evol Comput."},{"issue":"8","key":"25_CR8","doi-asserted-by":"publisher","first-page":"B-454","DOI":"10.1287\/mnsc.13.8.B454","volume":"13","author":"JT Presby","year":"1967","unstructured":"Presby, J.T., Wolfson, M.L.: An algorithm for solving job sequencing problems. Manage. Sci. 13(8), B-454\u2013B-464 (1967)","journal-title":"Manage. Sci."},{"key":"25_CR9","first-page":"76","volume":"10","author":"K Karthikeyan","year":"2010","unstructured":"Karthikeyan, K.: Heuristics algorithms for job sequencing problems. Global J. Sci. Front. Res. GJSFR Classif.-D. 10, 76\u201386 (2010)","journal-title":"Global J. Sci. Front. Res. GJSFR Classif.-D."},{"unstructured":"Iqbal, P.: Job sequencing problem using advanced heuristics techniques. In: Proceedings of the International Conference on Applied Mathematics and Theoretical Computer Science, ICPMT, vol. 12, pp. 89\u2013100 (2013)","key":"25_CR10"},{"key":"25_CR11","first-page":"67","volume":"12","author":"RM Das","year":"2008","unstructured":"Das, R.M., Man, M.H.: Job-Shop scheduling problem with sequence dependent setup times. Int. Multi Conf. Eng. Comput. Sci. 12, 67\u201380 (2008)","journal-title":"Int. Multi Conf. Eng. Comput. Sci."},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1504\/IJPS.2011.044556","volume":"1","author":"KR Baker","year":"2011","unstructured":"Baker, K.R.: Solving sequencing problems in spreadsheets. Int. J. Plan. Schedul. 1, 3 (2011)","journal-title":"Int. J. Plan. Schedul."},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"15","DOI":"10.3844\/ajeassp.2010.15.24","volume":"3","author":"A Norozi","year":"2010","unstructured":"Norozi, A.: Application of intelligence based genetic algorithm for job sequencing problem on parallel mixed-model assembly line. Am. J. Eng. Appl. Sci. 3, 15\u201324 (2010)","journal-title":"Am. J. Eng. Appl. Sci."},{"key":"25_CR14","first-page":"2020","volume":"9","author":"W Bo\u017cejko","year":"2012","unstructured":"Bo\u017cejko, W., Hejducki, Z., Uchro\u0144ski, M., Wodecki, M.: Solving the flexible job shop problem on multi-GPU. Int. Conf. Comput. Sci. 9, 2020\u20132023 (2012)","journal-title":"Int. Conf. Comput. Sci."},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.cor.2017.07.013","volume":"88","author":"GS Paiva","year":"2017","unstructured":"Paiva, G.S., Carvalho, M.A.M.: Improved heuristic algorithms for the Job sequencing and tool switching problem. Comput. Oper. Res. 88, 208\u2013219 (2017)","journal-title":"Comput. Oper. Res."},{"key":"25_CR16","doi-asserted-by":"publisher","first-page":"148741","DOI":"10.1109\/ACCESS.2019.2946032","volume":"7","author":"SW Lin","year":"2019","unstructured":"Lin, S.W., Ying, K.C., Wu, W.J., Cheng, C.Y.: Single machine job sequencing with a restricted common due window. IEEE Access 7, 148741\u2013148755 (2019)","journal-title":"IEEE Access"},{"key":"25_CR17","first-page":"159","volume":"25","author":"JS Wook","year":"2016","unstructured":"Wook, J.S., Woo, K.J.: Solving the constrained job sequencing problem using candidate order based Tabu search. J. Inf. Syst. 25, 159\u2013182 (2016)","journal-title":"J. Inf. Syst."}],"container-title":["Communications in Computer and Information Science","Computing Science, Communication and Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-6648-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T07:45:31Z","timestamp":1625125531000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-15-6648-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811566479","9789811566486"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-6648-6_25","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"19 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMS2","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computing Science, Communication and Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gujarat","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 March 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 March 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"coms22020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/coms2.gnu.ac.in\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"79","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":"26","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":"1","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":"33% - 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":"2","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the COVID-19 pandemic COMS2 2020 was held virtually","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}