{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,23]],"date-time":"2024-06-23T03:10:03Z","timestamp":1719112203985},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,3,17]],"date-time":"2017-03-17T00:00:00Z","timestamp":1489708800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Manag Sci"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s10287-017-0276-7","type":"journal-article","created":{"date-parts":[[2017,3,17]],"date-time":"2017-03-17T07:49:37Z","timestamp":1489736977000},"page":"281-291","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A developed slope order index (SOI) for bottlenecks in projects and production lines"],"prefix":"10.1007","volume":"14","author":[{"given":"Mehdi Rajabi","family":"Asadabadi","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,17]]},"reference":[{"issue":"3","key":"276_CR1","first-page":"305","volume":"6","author":"M Asadabadi","year":"2015","unstructured":"Asadabadi M (2015) A revision on EOQ\/JIT indifference points. Int J Ind Eng Comput 6(3):305\u2013314","journal-title":"Int J Ind Eng Comput"},{"issue":"1","key":"276_CR2","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1515\/sbe-2016-0001","volume":"11","author":"M Asadabadi","year":"2016","unstructured":"Asadabadi M (2016) A Revision on Cost Elements of the EOQ Model. Stud Bus Econ 11(1):5\u201314","journal-title":"Stud Bus Econ"},{"issue":"1","key":"276_CR3","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10479-013-1415-3","volume":"211","author":"B Bilgen","year":"2013","unstructured":"Bilgen B, \u00c7elebi Y (2013) Integrated production scheduling and distribution planning in dairy supply chain by hybrid modelling. Ann Oper Res 211(1):55\u201382","journal-title":"Ann Oper Res"},{"issue":"3","key":"276_CR4","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1007\/s00291-007-0095-2","volume":"30","author":"N Boysen","year":"2008","unstructured":"Boysen N, Fliedner M, Scholl A (2008) Sequencing mixed-model assembly lines to minimize part inventory cost. OR Spectr 30(3):611\u2013633","journal-title":"OR Spectr"},{"key":"276_CR5","doi-asserted-by":"crossref","unstructured":"Campbell HG, Dudek RA, Smith ML (1970) A heuristic algorithm for the n job, m machine sequencing problem. Manag Sci 16(10):B-630","DOI":"10.1287\/mnsc.16.10.B630"},{"issue":"1","key":"276_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0207001","volume":"7","author":"JEG Coffman","year":"1978","unstructured":"Coffman JEG, Garey MR, Johnson DS (1978) An application of bin-packing to multiprocessor scheduling. SIAM J Comput 7(1):1\u201317","journal-title":"SIAM J Comput"},{"key":"276_CR7","doi-asserted-by":"crossref","unstructured":"Eastman WL, Even S, Isaacs IM (1964) Bounds for the optimal scheduling of n jobs on m processors. Manag Sci (Pre-1986) 11(2):268","DOI":"10.1287\/mnsc.11.2.268"},{"key":"276_CR8","doi-asserted-by":"crossref","unstructured":"Elmaghraby SE (1978) The economic lot scheduling problem (elsp): review and extensions. Manag Sci (Pre-1986) 24(6):587","DOI":"10.1287\/mnsc.24.6.587"},{"key":"276_CR9","doi-asserted-by":"crossref","unstructured":"Elvikis D, T\u2019kindt V, (2014) Two-agent scheduling on uniform parallel machines with min-max criteria. Ann Oper Res 213(1):79\u201394","DOI":"10.1007\/s10479-012-1099-0"},{"issue":"1","key":"276_CR10","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s10951-010-0214-9","volume":"14","author":"M Fliedner","year":"2011","unstructured":"Fliedner M, Boysen N, Scholl A (2011) On the part inventory model sequencing problem: complexity and beam search heuristic. J Sched 14(1):17\u201325","journal-title":"J Sched"},{"issue":"3","key":"276_CR11","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1287\/mnsc.11.3.476","volume":"11","author":"W Gapp","year":"1965","unstructured":"Gapp W, Mankekar PS, Mitten LG (1965) Sequencing operations to minimize in-process inventory costs. Manag Sci 11(3):476","journal-title":"Manag Sci"},{"issue":"2","key":"276_CR12","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s10951-013-0346-9","volume":"17","author":"P Gy\u00f6rgyi","year":"2014","unstructured":"Gy\u00f6rgyi P, Kis T (2014) Approximation schemes for single machine scheduling with non-renewable resource constraints. J Sched 17(2):135\u2013144","journal-title":"J Sched"},{"issue":"1","key":"276_CR13","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s10479-012-1289-9","volume":"213","author":"\u00d6 Hazir","year":"2014","unstructured":"Hazir \u00d6, Kedad-sidhoum S (2014) Batch sizing and just-in-time scheduling with common due date. Ann Oper Res 213(1):187\u2013202","journal-title":"Ann Oper Res"},{"issue":"1","key":"276_CR14","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/s10479-012-1167-5","volume":"203","author":"SK Heath","year":"2013","unstructured":"Heath SK, Bard JF, Morrice DJ (2013) A GRASP for simultaneously assigning and sequencing product families on flexible assembly lines. Ann Oper Res 203(1):295\u2013323","journal-title":"Ann Oper Res"},{"issue":"1","key":"276_CR15","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/j.ijpe.2006.02.008","volume":"104","author":"M K\u00e4mpf","year":"2006","unstructured":"K\u00e4mpf M, K\u00f6chel P (2006) Simulation-based sequencing and lot size optimisation for a production-and-inventory system with multiple items. Int J Prod Econ 104(1):191\u2013200","journal-title":"Int J Prod Econ"},{"issue":"1","key":"276_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","volume":"6","author":"R McNaughton","year":"1959","unstructured":"McNaughton R (1959) Scheduling with deadlines and loss functions. Manag Sci 6(1):1\u201312","journal-title":"Manag Sci"},{"issue":"1","key":"276_CR17","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1057\/jors.2013.9","volume":"65","author":"B Mor","year":"2014","unstructured":"Mor B, Mosheiov G (2014) Polynomial time solutions for scheduling problems on a proportionate flowshop with two competing agents. J Oper Res Soc 65(1):151\u2013157","journal-title":"J Oper Res Soc"},{"issue":"6","key":"276_CR18","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1007\/s10951-012-0280-2","volume":"16","author":"J Pacheco","year":"2013","unstructured":"Pacheco J, \u00c1ngel-bello F, \u00c1lvarez A (2013) A multi-start tabu search method for a single-machine scheduling problem with periodic maintenance and sequence-dependent set-up times. J Sched 16(6):661\u2013673","journal-title":"J Sched"},{"issue":"1","key":"276_CR19","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10951-013-0349-6","volume":"17","author":"SC Sarin","year":"2014","unstructured":"Sarin SC, Sherali HD, Liao L (2014) Minimizing conditional-value-at-risk for stochastic scheduling problems. J Sched 17(1):5\u201315","journal-title":"J Sched"},{"issue":"4\u20135","key":"276_CR20","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s10951-007-0025-9","volume":"10","author":"D Shabtay","year":"2007","unstructured":"Shabtay D, Steiner G (2007) Single machine batch scheduling to minimize total completion time and resource consumption costs. J Sched 10(4\u20135):255\u2013261","journal-title":"J Sched"},{"issue":"1","key":"276_CR21","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s10479-013-1339-y","volume":"206","author":"L Shen","year":"2013","unstructured":"Shen L, M\u00f6nch L, Buscher U (2013) An iterative approach for the serial batching problem with parallel machines and job families. Ann Oper Res 206(1):425\u2013448","journal-title":"Ann Oper Res"},{"key":"276_CR22","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1016\/j.ijpe.2006.10.010","volume":"107","author":"TS Vaughan","year":"2007","unstructured":"Vaughan TS (2007) Cyclical schedules vs. dynamic sequencing: replenishment dynamics and inventory efficiency. Int J Prod Econ 107:518\u2013527","journal-title":"Int J Prod Econ"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-017-0276-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10287-017-0276-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-017-0276-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,23]],"date-time":"2024-06-23T02:28:15Z","timestamp":1719109695000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10287-017-0276-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,17]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["276"],"URL":"https:\/\/doi.org\/10.1007\/s10287-017-0276-7","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"value":"1619-697X","type":"print"},{"value":"1619-6988","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,17]]}}}