{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:11:56Z","timestamp":1743066716405,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031398209"},{"type":"electronic","value":"9783031398216"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-39821-6_10","type":"book-chapter","created":{"date-parts":[[2023,8,15]],"date-time":"2023-08-15T21:01:25Z","timestamp":1692133285000},"page":"126-133","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Finite-Domain Constraint-Based Approach on\u00a0the\u00a0Stockyard Planning Problem"],"prefix":"10.1007","author":[{"given":"Sven","family":"L\u00f6ffler","sequence":"first","affiliation":[]},{"given":"Ilja","family":"Becker","sequence":"additional","affiliation":[]},{"given":"Petra","family":"Hofstedt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,16]]},"reference":[{"key":"10_CR1","unstructured":"Google LLC, Google OR-Tools, 2019. http:\/\/developers.google.com\/optimization\/. Accessed 31 May 2023"},{"key":"10_CR2","unstructured":"Jacop solver 4.4. http:\/\/jacop.osolpro.com\/. Accessed 24 Jan 2023"},{"key":"10_CR3","unstructured":"Abdekhodaee, A.H., Dunstall, S., Ernst, A.T., Lam, L.: Integration of stockyard and rail network: a scheduling case study. In: 5th Asia-Pacific Industrial Engineering and Management Systems Conference. Gold Coast, Australia, pp. 1\u201316 (2004)"},{"key":"10_CR4","unstructured":"Apt, K.: Constraint satisfaction problems: examples. In: [5] (2003), chapter 2"},{"key":"10_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511615320","volume-title":"Principles of Constraint Programming","author":"K Apt","year":"2003","unstructured":"Apt, K.: Principles of Constraint Programming. Cambridge University Press, New York, NY, USA (2003)"},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"Boland, N., Gulczynski, D., Savelsbergh, M.W.P.: A stockyard planning problem. EURO J. Transp. Logist. 1(3) (2012). https:\/\/doi.org\/10.1007\/s13676-012-0011-z","DOI":"10.1007\/s13676-012-0011-z"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Dechter, R.: Constraint networks. [8], chap. 2, pp. 25\u201349","DOI":"10.1016\/B978-155860890-0\/50003-7"},{"key":"10_CR8","unstructured":"Dechter, R.: Constraint Processing. Elsevier Morgan Kaufmann, Burlington (2003)"},{"key":"10_CR9","doi-asserted-by":"publisher","unstructured":"Lodi, A., Martello, S., Monaci, M.: Two-dimensional packing problems: a survey. Eur. J. Oper. Res. 141(2) (2002). https:\/\/doi.org\/10.1016\/S0377-2217(02)00123-6","DOI":"10.1016\/S0377-2217(02)00123-6"},{"key":"10_CR10","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/5625.001.0001","volume-title":"Programming with Constraints - An Introduction","author":"K Marriott","year":"1998","unstructured":"Marriott, K., Stuckey, P.J.: Programming with Constraints - An Introduction. MIT Press, Cambridge (1998)"},{"key":"10_CR11","unstructured":"Prud\u2019homme, C., Fages, J.G., Lorca, X.: Choco documentation (2017). http:\/\/choco-solver.org\/docs\/considerations\/. Accessed 31 May 2023"},{"key":"10_CR12","unstructured":"Schulte, C., Lagerkvist, M., Tack, G.: Gecode 6.2.0 (2019). www.gecode.org\/. Accessed 31 May 2023"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-319-45940-0_19","volume-title":"Internet and Distributed Computing Systems","author":"C Wen","year":"2016","unstructured":"Wen, C., Zheng, L.: A constraint programming based method for stockyard management problem. In: Li, W., et al. (eds.) IDCS 2016. LNCS, vol. 9864, pp. 214\u2013221. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45940-0_19"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-39821-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T18:46:40Z","timestamp":1710269200000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-39821-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031398209","9783031398216"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-39821-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"16 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DEXA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database and Expert Systems Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Penang","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Malaysia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.dexa.org\/dexa2023","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":"155","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":"49","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":"35","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":"32% - 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":"4","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":"For the workshops 7 full and 3 short papers have been accepted from 20 submissions","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)"}}]}}