{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T09:27:39Z","timestamp":1766136459439},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,2,1]],"date-time":"2014-02-01T00:00:00Z","timestamp":1391212800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s10951-013-0364-7","type":"journal-article","created":{"date-parts":[[2014,1,31]],"date-time":"2014-01-31T22:10:19Z","timestamp":1391206219000},"page":"305-319","source":"Crossref","is-referenced-by-count":14,"title":["Optimization of inland shipping"],"prefix":"10.1007","volume":"17","author":[{"given":"Jens","family":"Hermans","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,2,1]]},"reference":[{"issue":"6","key":"364_CR1","doi-asserted-by":"crossref","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. (1999). Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times. Journal of Scheduling, 2(6), 245\u2013252.","journal-title":"Journal of Scheduling"},{"key":"364_CR2","doi-asserted-by":"crossref","unstructured":"Baptiste, P. (2000). Scheduling equal-length jobs on identical parallel machines. Discrete Applied Mathematics, 103(1\u20133), 21\u201332.","DOI":"10.1016\/S0166-218X(99)00238-3"},{"key":"364_CR3","unstructured":"Brucker, P., & Knust, S. (2009). Complexity results for scheduling problems. http:\/\/www.informatik.uni-osnabrueck.de\/knust\/class\/ ."},{"issue":"1","key":"364_CR4","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10951-006-5595-4","volume":"9","author":"M Chrobak","year":"2006","unstructured":"Chrobak, M., D\u00fcrr, C., Jawor, W., Kowalik, L., & Kurowski, M. (2006). A note on scheduling equal-length jobs to maximize throughput. Journal of Scheduling, 9(1), 71\u201373.","journal-title":"Journal of Scheduling"},{"key":"364_CR5","unstructured":"FKS. (2007). Formal & knowledge systems\u2014waterborne. Retrieved from http:\/\/www.fks-waterborne.eu\/ ."},{"issue":"2","key":"364_CR6","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1137\/0210018","volume":"10","author":"M Garey","year":"1981","unstructured":"Garey, M., Johnson, D., Simons, B., & Tarjan, R. (1981). Scheduling unit-time tasks with arbitrary release times and deadlines. SIAM Journal on Computing, 10(2), 256\u2013269.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"364_CR7","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R Graham","year":"1979","unstructured":"Graham, R., Lawler, E., Lenstra, J., & Kan, A. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5(2), 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"364_CR8","unstructured":"Hermans, J. (2008). Optimalisatie van binnenscheepvaart. Master\u2019s thesis, KU Leuven."},{"issue":"5","key":"364_CR9","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1287\/mnsc.19.5.544","volume":"19","author":"E Lawler","year":"1973","unstructured":"Lawler, E. (1973). Optimal sequencing of a single machine subject to precedence constraints. Management Science, 19(5), 544\u2013546.","journal-title":"Management Science"},{"issue":"1\u20133","key":"364_CR10","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/S0166-218X(01)00347-X","volume":"123","author":"A Lodi","year":"2002","unstructured":"Lodi, A., Martello, S., & Vigo, D. (2002). Recent advances on two-dimensional bin packing problems. Discrete Applied Mathematics, 123(1\u20133), 379\u2013396.","journal-title":"Discrete Applied Mathematics"},{"key":"364_CR11","unstructured":"L\u00f3pez-Ortiz, A., & Quimper, C. G. (2011). A fast algorithm for multi-machine scheduling problems with jobs of equal processing times. In T. Schwentick, & C. D\u00fcrr (Eds.), Symposium on Theoretical Aspects of Computer Science (STACS), Vol. 9 of Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (pp. 380\u2013391)."},{"key":"364_CR12","unstructured":"Mundy, R., & Campbell, J. (2005). Management systems for inland waterway traffic control. Technical report. Retrieved from http:\/\/www.ctre.iastate.edu\/mtc\/reports\/inland_waterway\/volume1.htm ."},{"key":"364_CR13","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1137\/0212018","volume":"12","author":"B Simons","year":"1983","unstructured":"Simons, B. (1983). Multiprocessor scheduling of unit-time jobs with arbitrary release times and deadlines. SIAM Journal on Computing, 12, 294.","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"364_CR14","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1061\/(ASCE)0733-950X(1998)124:4(199)","volume":"124","author":"C Ting","year":"1998","unstructured":"Ting, C., & Schonfeld, P. (1998). Integrated control for series of waterway locks. Journal of Waterway, Port, Coastal and Ocean Engineering, 124(4), 199\u2013207.","journal-title":"Journal of Waterway, Port, Coastal and Ocean Engineering"},{"key":"364_CR15","doi-asserted-by":"crossref","unstructured":"Zhang, X., Qi, H., Fu, X., & Yuan, X. (2007). Hybrid algorithm to minimize total weighted wait-time of ships for navigation co-scheduling in the three Gorges project. In International Conference on Transportation, Engineering (pp. 2759\u20132764).","DOI":"10.1061\/40932(246)453"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-013-0364-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-013-0364-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-013-0364-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T05:49:41Z","timestamp":1565156981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-013-0364-7"}},"subtitle":["A polynomial time algorithm for the single-ship single-lock optimization problem"],"short-title":[],"issued":{"date-parts":[[2014,2,1]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["364"],"URL":"https:\/\/doi.org\/10.1007\/s10951-013-0364-7","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,1]]}}}