{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T21:08:55Z","timestamp":1774127335379,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2006,12,1]],"date-time":"2006-12-01T00:00:00Z","timestamp":1164931200000},"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":[[2006,12]]},"DOI":"10.1007\/s10951-006-8787-z","type":"journal-article","created":{"date-parts":[[2006,7,22]],"date-time":"2006-07-22T00:49:48Z","timestamp":1153529388000},"page":"515-543","source":"Crossref","is-referenced-by-count":16,"title":["Two-machine flow shop problems with a single server"],"prefix":"10.1007","volume":"9","author":[{"given":"Andrew","family":"Lim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brian","family":"Rodrigues","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Caixia","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"8787_CR1","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0305-0548(00)00074-5","volume":"29","author":"A. H. Abdekhodaee","year":"2002","unstructured":"Abdekhodaee, A. H. and A. Wirth, \u2018Scheduling parallel machines with a single server: Some solvable cases and heuristics,\u2019 Computers and Operations Research 29(3), 295\u2013315 (2002).","journal-title":"Computers and Operations Research"},{"issue":"l","key":"8787_CR2","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/S0377-2217(97)00136-7","volume":"109","author":"M. Ben-Daya","year":"1998","unstructured":"Ben-Daya, M. and M. Al-Fawzan, \u2018A tabu search approach for the flow-shop scheduling problem,\u2019 European Journal of Operational Research 109(l), 88\u201395 (1998).","journal-title":"European Journal of Operational Research"},{"key":"8787_CR3","unstructured":"Brucker, P., S. Knust, and G. Wang, \u2018Complexity results for flow-shop problems with a single server,\u2019 OSM Reihe P, Heft 237, (2001)."},{"issue":"2","key":"8787_CR4","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/0377-2217(93)E0228-P","volume":"80","author":"C. L. Chen","year":"1995","unstructured":"Chen, C. L., V. S. Vempati, and N. Aljaber, \u2018An application of genetic algorithms for flow-shop problems,\u2019 European Journal of Operational Research 80(2), 389\u2013396 (1995).","journal-title":"European Journal of Operational Research"},{"issue":"7","key":"8787_CR5","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1016\/S0305-0548(98)00087-2","volume":"26","author":"T. C. E. Cheng","year":"1999","unstructured":"Cheng, T. C. E., G. Wang, and C. Sriskandarajah, \u2018One-operator two-machine flow-shop scheduling with setup and dismounting times,\u2019 Computers and Operations Research 26(7), 715\u2013730 (1999).","journal-title":"Computers and Operations Research"},{"issue":"2","key":"8787_CR6","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"M. R. Garey","year":"1974","unstructured":"Garey, M. R., D. S. Johnson, and R. Sethi, \u2018The complexity of flowshop and jobshop scheduling,\u2019 Mathematics of Operations Research 1(2), 117\u2013128 (1974).","journal-title":"Mathematics of Operations Research"},{"key":"8787_CR7","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1002\/(SICI)1520-6750(200006)47:4<304::AID-NAV3>3.0.CO;2-1","volume":"47","author":"C. A. Glass","year":"2000","unstructured":"Glass, C. A., Y. M. Shafransky, and V. A. Strusevich, \u2018Scheduling for parallel dedicated machines with a single server,\u2019 Naval Research Logistics 47, 304\u2013328 (2000).","journal-title":"Naval Research Logistics"},{"issue":"3","key":"8787_CR8","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F., \u2018Tabu Search-Part I,\u2019 ORSA Journal on Computing 1(3), 190\u2013206 (1989).","journal-title":"ORSA Journal on Computing"},{"issue":"1","key":"8787_CR9","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"Glover, F., \u2018Tabu Search-Part II,\u2019 ORSA Journal on Computing 2(1), 4\u201332 (1990).","journal-title":"ORSA Journal on Computing"},{"key":"8787_CR10","volume-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"D. E. Goldberg","year":"1989","unstructured":"Goldberg, D. E., Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1989."},{"key":"8787_CR11","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1057\/jors.1988.63","volume":"39","author":"J. N. D. Gupta","year":"1988","unstructured":"Gupta, J. N. D., \u2018Two-stage, hybrid flowshop scheduling problem,\u2019 Journal of Operational Research Society 39, 359\u2013364 (1988).","journal-title":"Journal of Operational Research Society"},{"key":"8787_CR12","doi-asserted-by":"crossref","unstructured":"Gupta, J. N. D. and W. P. Darrow, \u2018The Two-Machine Sequence Dependent Flowshop Scheduling Problem,\u2019 European Journal of Operational Research, 439\u2013446 (1986).","DOI":"10.1016\/0377-2217(86)90037-8"},{"key":"8787_CR13","volume-title":"Adaptation in Nature and Artificial Systems","author":"J. Holland","year":"1975","unstructured":"Holland, J., Adaptation in Nature and Artificial Systems, University of Michigan Press, Ann Arbor, MI, USA, 1975."},{"issue":"2","key":"8787_CR14","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1016\/0377-2217(93)E0235-P","volume":"81","author":"H. Ishibuchi","year":"1995","unstructured":"Ishibuchi, H., S. Misaki, and H. Tanaka, \u2018Modified simulated annealing algorithms for the flow-shop sequencing problem,\u2019 European Journal of Operational Research 81(2), 388\u2013398, (1995).","journal-title":"European Journal of Operational Research"},{"issue":"l","key":"8787_CR15","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"S. M. Johnson","year":"1954","unstructured":"Johnson, S. M., \u2018Optimal two- and three-stage production schedules with set-up times included,\u2019 Naval Research Logistics Quarterly 1(l), 61\u201368 (1954).","journal-title":"Naval Research Logistics Quarterly"},{"key":"8787_CR16","unstructured":"Krajeswski, L. J. and L. P. Ritzman, Operations Management: Strategy and Analysis, Reading, MA: Addison-Wesley, 1987."},{"key":"8787_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-7744-1","volume-title":"Aarts, Simulated Annealing: Theory and Applications","author":"P. J. M. Laarhoven","year":"1987","unstructured":"Laarhoven, P. J. M. and E. H. L. Aarts, Aarts, Simulated Annealing: Theory and Applications, Kluwer Academic Publishers, Norwell, MA, 1987."},{"key":"8787_CR18","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1080\/00207548408942479","volume":"22","author":"S. L. Narasimhan","year":"1984","unstructured":"Narasimhan, S. L. and S. S. Panwalkar, \u2018Scheduling in a two-stage manufacturing process,\u2019 International Journal of Production Research 22, 555\u2013564 (1984).","journal-title":"International Journal of Production Research"},{"issue":"4","key":"8787_CR19","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1016\/0360-8352(96)00053-8","volume":"30","author":"T. Murata","year":"1996","unstructured":"Murata, T., H. Ishibuchi, and H. Tanaka, \u2018Genetic Algorithms for Flowshop Scheduling Problems,\u2019 Computer and Industrial Engineering 30(4), 1061\u20131071 (1996).","journal-title":"Computer and Industrial Engineering"},{"issue":"3","key":"8787_CR20","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0305-0548(90)90001-N","volume":"17","author":"F. A. Ogbu","year":"1990a","unstructured":"Ogbu, F. A. and D. K. Smith, \u2018The application of the simulated annealing algorithm to the solution of the n\/m\/Cmax flowshop problem,\u2019 Computers and Operations Research 17(3), 243\u2013253 (1990a).","journal-title":"Computers and Operations Research"},{"issue":"1","key":"8787_CR21","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/0305-0483(91)90036-S","volume":"19","author":"F. A. Ogbu","year":"1990b","unstructured":"Ogbu, F. A. and D. K. Smith, \u2018Simulated annealing for the permutation flowshop problem,\u2019 OMEGA 19(1), 64\u201367 (1990b).","journal-title":"OMEGA"},{"key":"8787_CR22","first-page":"64","volume":"19","author":"I. Oliver","year":"1987","unstructured":"Oliver, I., D. Smith, and J. Holland, \u2018Simulated Annealing for the permutation flowshop scheduling,\u2019 OMEGA 19, 64\u201367 (1987).","journal-title":"OMEGA"},{"issue":"6","key":"8787_CR23","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/0305-0483(89)90059-5","volume":"17","author":"I. H. Osman","year":"1989","unstructured":"Osman, I. H. and C. N. Potts., \u2018Simulated Annealing for Permutation Flow-Shop Scheduling,\u2019 OMEGA 17(6), 551\u2013557 (1989).","journal-title":"OMEGA"},{"key":"8787_CR24","unstructured":"Resende, M. G. C. and C. C. Ribeiro, \u2018Greedy Randomized Adaptive Search Procedures,\u2019 AT&T Labs Research Technical Report TD-53RSJY, version, 2 (2002)."},{"issue":"1","key":"8787_CR25","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0377-2217(90)90090-X","volume":"47","author":"E. D. Taillard","year":"1990","unstructured":"Taillard, E. D., \u2018Some Efficient Heuristic Methods for the Flow Shop Sequencing Problem,\u2019 European Journal of Operational Research 47(1), 65\u201374 (1990).","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"8787_CR26","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1287\/ijoc.6.2.108","volume":"6","author":"E. D. Taillard","year":"1994","unstructured":"Taillard, E. D., \u2018Parallel Taboo Search Techniques for the Job Shop Scheduling Problem,\u2019 ORSA Journal on Computing 6(2), 108\u2013117 (1994).","journal-title":"ORSA Journal on Computing"},{"issue":"2","key":"8787_CR27","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/0377-2217(89)90383-4","volume":"41","author":"M. Widmer","year":"1989","unstructured":"Widmer, M. and A. Hertz, \u2018A new heuristic method for the flow-shop sequencing problem,\u2019 European Journal of Operational Research 41(2), 186\u2013193 (1989).","journal-title":"European Journal of Operational Research"},{"key":"8787_CR28","unstructured":"Yamada, T. and C. R. Reeves, \u2018Permutation flowshop scheduling by genetic local search,\u201d Proceedings of Second International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications (GALESIA\u203297),\u2019 Institution of Electrical Engineers London, 232\u2013238 (1997)."},{"key":"8787_CR29","doi-asserted-by":"crossref","unstructured":"Yamada, T. and C. R. Reeves, \u2018Genetic Algorithms, Path Relinking and the Flowshop Sequencing Problem,\u2019 Evolutionary Computation journal (MIT press), 6(1), 230\u2013234 (1998b).","DOI":"10.1162\/evco.1998.6.1.45"},{"key":"8787_CR30","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1080\/05695557908974469","volume":"11","author":"T. Yoshida","year":"1979","unstructured":"Yoshida, T. and K. Hitomi, \u2018Optimal two-stage production scheduling with setup times separated,\u2019 AIIE Transactions 11, 261\u2013263 (1979).","journal-title":"AIIE Transactions"},{"issue":"3","key":"8787_CR31","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1016\/0377-2217(94)00021-4","volume":"85","author":"S. H. Zegordi","year":"1995","unstructured":"Zegordi, S. H., K. Itoh, and T. Enkawa, \u2018Minimizing makespan for flow-shop scheduling by combining simulated annealing with sequencing knowledge,\u2019 European Journal of Operational Research 85(3), 515\u2013531 (1995).","journal-title":"European Journal of Operational Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-006-8787-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-006-8787-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-006-8787-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:39Z","timestamp":1559468379000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-006-8787-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12]]},"references-count":31,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2006,12]]}},"alternative-id":["8787"],"URL":"https:\/\/doi.org\/10.1007\/s10951-006-8787-z","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12]]}}}