{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T07:44:42Z","timestamp":1724744682114},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,4,24]],"date-time":"2015-04-24T00:00:00Z","timestamp":1429833600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s10100-015-0395-6","type":"journal-article","created":{"date-parts":[[2015,4,23]],"date-time":"2015-04-23T11:35:26Z","timestamp":1429788926000},"page":"731-745","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Mixed integer programming formulations for the Biomass Truck Scheduling problem"],"prefix":"10.1007","volume":"24","author":[{"given":"L\u00e1szl\u00f3","family":"Torjai","sequence":"first","affiliation":[]},{"given":"Ferenc","family":"Kruzslicz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,24]]},"reference":[{"key":"395_CR1","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0305-0548(00)00074-5","volume":"29","author":"AH Abdekhodaee","year":"2002","unstructured":"Abdekhodaee AH, Wirth A (2002) Scheduling parallel machines with a single server: some solvable cases and heuristics. Comput Oper Res 29:295\u2013315","journal-title":"Comput Oper Res"},{"key":"395_CR2","doi-asserted-by":"crossref","first-page":"1867","DOI":"10.1016\/S0305-0548(03)00144-8","volume":"31","author":"AH Abdekhodaee","year":"2004","unstructured":"Abdekhodaee AH, Wirth A, Gan HS (2004) Equal processing and equal setup times cases of scheduling parallel machines with a single server. Comput Oper Res 31:1867\u20131889","journal-title":"Comput Oper Res"},{"key":"395_CR3","volume-title":"Network flows: theory, algorithms and applications","author":"R Ahuja","year":"1993","unstructured":"Ahuja R, Magnanti T, Orlin J (1993) Network flows: theory, algorithms and applications. Prentice-Hall, Englewood Cliffs"},{"key":"395_CR4","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/S0377-2217(02)00758-0","volume":"149","author":"C Artigues","year":"2003","unstructured":"Artigues C, Michelon P, Reusser S (2003) Insertion techniques for static and dynamic resource-constrained project scheduling. Eur J Oper Res 149:249\u2013267","journal-title":"Eur J Oper Res"},{"key":"395_CR5","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1002\/jos.120","volume":"5","author":"P Brucker","year":"2002","unstructured":"Brucker P, Dhaenens-Flipo C, Knust S, Kravchenko SA, Werner F (2002) Complexity results for parallel machine problems with a single server. J Sched 5:429\u2013457","journal-title":"J Sched"},{"key":"395_CR6","doi-asserted-by":"crossref","first-page":"1590","DOI":"10.1287\/mnsc.41.10.1590","volume":"41","author":"E Demeulemeester","year":"1995","unstructured":"Demeulemeester E (1995) Minimizing resource availability costs in timelimited project networks. Manage Sci 41:1590\u20131598","journal-title":"Manage Sci"},{"key":"395_CR7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1287\/opre.1070.0459","volume":"56","author":"M Durbin","year":"2008","unstructured":"Durbin M, Hoffman K (2008) The dance of the thirty-ton trucks: dispatching and scheduling in a dynamic environment. Oper Res 56:3\u201319","journal-title":"Oper Res"},{"key":"395_CR8","doi-asserted-by":"crossref","first-page":"2242","DOI":"10.1016\/j.cor.2011.11.007","volume":"39","author":"HS Gan","year":"2012","unstructured":"Gan HS, Wirth A, Abdekhodaee A (2012) A branch-and-price algorithm for the general case of scheduling parallel machines with a single server. Comput Oper Res 39:2242\u20132247","journal-title":"Comput Oper Res"},{"key":"395_CR9","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/j.jclepro.2010.08.009","volume":"19","author":"S Gold","year":"2011","unstructured":"Gold S, Seuring S (2011) Supply chain and logistics issues of bio-energy production. J Clean Prod 19:32\u201342","journal-title":"J Clean Prod"},{"key":"395_CR10","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1016\/j.cor.2003.08.007","volume":"32","author":"S Guirchoun","year":"2005","unstructured":"Guirchoun S, Martineau P, Billaut JC (2005) Total completion time minimization in a computer system with a server and two parallel processors. Comput Oper Res 32:599\u2013611","journal-title":"Comput Oper Res"},{"key":"395_CR11","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0166-218X(99)00206-1","volume":"102","author":"NG Hall","year":"2000","unstructured":"Hall NG, Potts CN, Sriskandarajah C (2000) Parallel machine scheduling with a common server. Discrete Appl Math 102:223\u2013243","journal-title":"Discrete Appl Math"},{"key":"395_CR12","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.biortech.2011.09.111","volume":"103","author":"JD Judd","year":"2012","unstructured":"Judd JD, Sarin SC, Cundiff JS (2012) Design, modeling, and analysis of a feedstock logistics system. Bioresource Technol 103:209\u2013218","journal-title":"Bioresource Technol"},{"key":"395_CR13","doi-asserted-by":"crossref","first-page":"2457","DOI":"10.1016\/j.cor.2011.12.011","volume":"39","author":"MY Kim","year":"2012","unstructured":"Kim MY, Lee YH (2012) MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server. Comput Oper Res 39:2457\u20132468","journal-title":"Comput Oper Res"},{"key":"395_CR14","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.cor.2014.02.008","volume":"48","author":"J Kinable","year":"2014","unstructured":"Kinable J, Wauters T, Vanden Berghe G (2014) The concrete delivery problem. Comput Oper Res 48:53\u201368","journal-title":"Comput Oper Res"},{"key":"395_CR15","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.cor.2009.12.011","volume":"38","author":"O Kon\u00e9","year":"2011","unstructured":"Kon\u00e9 O, Artigues C, Lopez P, Mongeau M (2011) Event-based MILP models for resource-constrained project scheduling problems. Comput Oper Res 38:3\u201313","journal-title":"Comput Oper Res"},{"key":"395_CR16","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1016\/0305-0548(96)00011-1","volume":"23","author":"CP Koulamas","year":"1996","unstructured":"Koulamas CP (1996) Scheduling two parallel semiautomatic machines to minimize machine interference. Comput Oper Res 23:945\u2013956","journal-title":"Comput Oper Res"},{"key":"395_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0895-7177(97)00236-7","volume":"26","author":"SA Kravchenko","year":"1997","unstructured":"Kravchenko SA, Werner F (1997) Parallel machine scheduling problems with a single server. Math Comput Model 26:1\u201311","journal-title":"Math Comput Model"},{"issue":"98","key":"395_CR18","first-page":"1","volume":"30","author":"SA Kravchenko","year":"1998","unstructured":"Kravchenko SA, Werner F (1998) Scheduling on parallel machines with a single and multiple servers. Otto-von-Guericke-Universitat Magdeburg. Preprint 30(98):1\u201318","journal-title":"Preprint"},{"key":"395_CR19","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1287\/opre.32.1.89","volume":"32","author":"RH M\u00f6hring","year":"1984","unstructured":"M\u00f6hring RH (1984) Minimizing costs of resource requirements in project networks subject to a fixed completion time. Oper Res 32:89\u2013120","journal-title":"Oper Res"},{"key":"395_CR20","unstructured":"Mukunda A, Ileleji KE, Wan H (2006) Simulation of corn stover logistics from on-farm storage to an ethanol plant. In: ASABE annual international meeting. ASABE Paper No. 066177. ASABE: St. Joseph, Mich"},{"key":"395_CR21","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/s10951-009-0104-1","volume":"13","author":"J Ou","year":"2010","unstructured":"Ou J, Qi X, Lee CY (2010) Parallel machine scheduling with multiple unloading servers. J Sched 13:213\u2013226","journal-title":"J Sched"},{"key":"395_CR22","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1287\/mnsc.16.1.93","volume":"16","author":"AAB Pritsker","year":"1969","unstructured":"Pritsker AAB, Watters LJ, Wolfe PM (1969) Multi-project scheduling with limited resources: a zero-one programming approach. Manage Sci 16:93\u2013108","journal-title":"Manage Sci"},{"key":"395_CR23","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1016\/j.amc.2007.07.022","volume":"196","author":"M Ranjbar","year":"2008","unstructured":"Ranjbar M, Kianfar F, Shadrokh S (2008) Solving the resource availability cost problem in project scheduling by path relinking and genetic algorithm. Appl Math Comput 196:879\u2013888","journal-title":"Appl Math Comput"},{"key":"395_CR24","doi-asserted-by":"crossref","first-page":"5710","DOI":"10.1016\/j.biortech.2007.10.044","volume":"99","author":"PP Ravula","year":"2008","unstructured":"Ravula PP, Grisso RD, Cundiff JS (2008) Comparison between two policy strategies for scheduling trucks in a biomass logistic system. Bioresource Technol 99:5710\u20135721","journal-title":"Bioresource Technol"},{"key":"395_CR25","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.ejor.2012.03.003","volume":"221","author":"J Rieck","year":"2012","unstructured":"Rieck J, Zimmermann J, Gather T (2012) Mixed-integer linear programming for resource leveling problems. Eur J Oper Res 221:27\u201337","journal-title":"Eur J Oper Res"},{"key":"395_CR26","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1016\/j.ejor.2010.03.008","volume":"206","author":"SB Rodrigues","year":"2010","unstructured":"Rodrigues SB, Yamashita DS (2010) An exact algorithm for minimizing resource availability costs in project scheduling. Eur J Oper Res 206:562\u2013568","journal-title":"Eur J Oper Res"},{"key":"395_CR27","first-page":"1","volume-title":"Biofuels methods and protocols","author":"S Sokhansanj","year":"2009","unstructured":"Sokhansanj S, Hess JR (2009) Biomass supply logistics and infrastructure. In: Mielenz Jonathan (ed) Biofuels methods and protocols. Humana Press, New York, pp 1\u201325"},{"key":"395_CR28","unstructured":"Th\u00f6rnblad K (2011) On the optimization of schedules of a multitask production cell. Chalmers University of Technology, Preprint 19(2011):1\u201364"},{"key":"395_CR29","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1016\/j.cie.2010.02.012","volume":"58","author":"Y Unlu","year":"2010","unstructured":"Unlu Y, Mason SJ (2010) Evaluation of mixed integer programming formulations for non-preemptive parallel machine scheduling problems. Comput Ind Eng 58:785\u2013800","journal-title":"Comput Ind Eng"},{"key":"395_CR30","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.biombioe.2011.01.049","volume":"38","author":"Y Voytenko","year":"2012","unstructured":"Voytenko Y, Peck P (2012) Organisational frameworks for straw-based energy systems in Sweden and Denmark. Biomass Bioenergy 38:34\u201348","journal-title":"Biomass Bioenergy"},{"key":"395_CR31","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1002\/nav.3800060205","volume":"6","author":"HM Wagner","year":"1959","unstructured":"Wagner HM (1959) An integer linear programming model for machine scheduling. Nav Res Logist Q 6:131\u2013140","journal-title":"Nav Res Logist Q"},{"key":"395_CR32","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s10951-006-0326-4","volume":"10","author":"DS Yamashita","year":"2007","unstructured":"Yamashita DS, Armentano VA, Laguna M (2007) Robust optimization models for project scheduling with resource availability cost. J Sched 10:67\u201376","journal-title":"J Sched"},{"key":"395_CR33","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/j.tre.2006.05.001","volume":"44","author":"S Yan","year":"2008","unstructured":"Yan S, Lai W, Chen M (2008) Production scheduling and truck dispatching of ready mixed concrete. Transport Res E-Log 44:164\u2013179","journal-title":"Transport Res E-Log"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-015-0395-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-015-0395-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-015-0395-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:49:33Z","timestamp":1559123373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-015-0395-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,24]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["395"],"URL":"https:\/\/doi.org\/10.1007\/s10100-015-0395-6","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,24]]}}}