{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T22:26:26Z","timestamp":1749507986990,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319591049"},{"type":"electronic","value":"9783319591056"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-59105-6_50","type":"book-chapter","created":{"date-parts":[[2017,5,16]],"date-time":"2017-05-16T07:45:06Z","timestamp":1494920706000},"page":"580-591","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Sampling Method for the Flow Shop with Uncertain Parameters"],"prefix":"10.1007","author":[{"given":"Pawe\u0142","family":"Rajba","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mieczys\u0142aw","family":"Wodecki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,17]]},"reference":[{"key":"50_CR1","volume-title":"Local Search in Combinatorial Optimization","author":"A Aarts","year":"1997","unstructured":"Aarts, A., Lenstra, J.K.: Local Search in Combinatorial Optimization. Wiley, New York (1997)"},{"key":"50_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-48086-2_26","volume-title":"Parallel Processing and Applied Mathematics","author":"M Wodecki","year":"2002","unstructured":"Wodecki, M., Bo\u017czejko, W.: Solving the flow shop problem by parallel simulated annealing. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Wa\u015bniewski, J. (eds.) PPAM 2001. LNCS, vol. 2328, pp. 236\u2013244. Springer, Heidelberg (2002). doi:10.1007\/3-540-48086-2_26"},{"issue":"2","key":"50_CR3","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/j.orl.2006.03.002","volume":"35","author":"W Bo\u017cejko","year":"2007","unstructured":"Bo\u017cejko, W., Wodecki, M.: On the theoretical properties of swap multimoves. Oper. Res. Lett. 35(2), 227\u2013231 (2007)","journal-title":"Oper. Res. Lett."},{"key":"50_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/978-3-319-07176-3_40","volume-title":"Artificial Intelligence and Soft Computing","author":"W Bo\u017cejko","year":"2014","unstructured":"Bo\u017cejko, W., Rajba, P., Wodecki, M.: Scheduling problem with uncertain parameters in just in time system. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2014. LNCS, vol. 8468, pp. 456\u2013467. Springer, Cham (2014). doi:10.1007\/978-3-319-07176-3_40"},{"key":"50_CR5","unstructured":"Dean B.C.: Approximation algorithms for stochastic scheduling problems. Ph.D. thesis, MIT (2005)"},{"key":"50_CR6","doi-asserted-by":"publisher","first-page":"1891","DOI":"10.1016\/S0305-0548(03)00145-X","volume":"31","author":"J Grabowski","year":"2004","unstructured":"Grabowski, J., Wodecki, M.: A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion. Comput. Oper. Res. 31, 1891\u20131909 (2004)","journal-title":"Comput. Oper. Res."},{"key":"50_CR7","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/S0167-6377(02)00110-4","volume":"30","author":"W Jang","year":"2002","unstructured":"Jang, W., Klein, C.M.: Minimizing the expected number of tardy jobs when processing times are normally distributed. Oper. Res. Lett. 30, 100\u2013106 (2002)","journal-title":"Oper. Res. Lett."},{"key":"50_CR8","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/0377-2217(95)00037-2","volume":"91","author":"E Nowicki","year":"1996","unstructured":"Nowicki, E., Smutnicki, C.: A fast tabu search algorithm for permutation flow shop problem. Eur. J. Oper. Res. 91, 160\u2013175 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"50_CR9","doi-asserted-by":"publisher","first-page":"169","DOI":"10.4064\/am39-2-5","volume":"39","author":"P Rajba","year":"2012","unstructured":"Rajba, P., Wodecki, M.: Stability of scheduling with random processing times on one machine. Applicationes Mathematicae 39(2), 169\u2013183 (2012)","journal-title":"Applicationes Mathematicae"},{"key":"50_CR10","unstructured":"Righter R., Stochastic scheduling. In: Shaked, M., Shandhkumar (eds.) Stochastic Orders. Academic Press, San Diego (1994)"},{"key":"50_CR11","unstructured":"Sioud, A., Gagn\u00e9, C., Gravel, M.: Minimizing total tardiness in a hybrid flexible flowshop with sequence dependent setup times. In: INFOCOMP 2014: The Fourth International Conference on Advanced Communications and Computation 2014, pp. 13\u201318 (2014)"},{"issue":"2","key":"50_CR12","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard, E.: Benchmarks for basic scheduling problems. EJOR 64(2), 278\u2013285 (1993)","journal-title":"EJOR"},{"key":"50_CR13","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10951-007-0034-8","volume":"11","author":"M Van den Akker","year":"2008","unstructured":"Van den Akker, M., Hoogeveen, H.: Minimizing the number of late jobs in a stochastic setting using a chance constraint. J. Sched. 11, 59\u201369 (2008)","journal-title":"J. Sched."},{"key":"50_CR14","unstructured":"Vondr\u00e1k, J.: Probabilistic methods in combinatorial and stochastic optimization. Ph.D. thesis, MIT (2005)"},{"issue":"3","key":"50_CR15","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0895-7177(97)00134-9","volume":"26","author":"X Zhu","year":"1997","unstructured":"Zhu, X., Cai, X.: General stochastic single-machine scheduling with regular cost functions. Math. Comput. Modell. 26(3), 95\u2013108 (1997)","journal-title":"Math. Comput. Modell."}],"container-title":["Lecture Notes in Computer Science","Computer Information Systems and Industrial Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59105-6_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,16]],"date-time":"2021-05-16T00:08:29Z","timestamp":1621123709000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-59105-6_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319591049","9783319591056"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59105-6_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"17 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CISIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP International Conference on Computer Information Systems and Industrial Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bialystok","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cisim2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wi.pb.edu.pl\/cisim2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}