{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T07:22:09Z","timestamp":1778656929575,"version":"3.51.4"},"reference-count":21,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2000,9]]},"DOI":"10.1016\/s0377-2217(99)00389-6","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T19:21:01Z","timestamp":1049484061000},"page":"469-485","source":"Crossref","is-referenced-by-count":5,"title":["Efficiency of reductions of job-shop to flow-shop problems"],"prefix":"10.1016","volume":"125","author":[{"given":"Alain","family":"Guinet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(99)00389-6_BIB1","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","article-title":"The shifting bottleneck procedure for job-shop scheduling","volume":"34","author":"Adams","year":"1988","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(99)00389-6_BIB2","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1287\/opre.4.2.244","article-title":"A graphical approach to production scheduling problems","volume":"4","author":"Akers","year":"1956","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00389-6_BIB3","doi-asserted-by":"crossref","first-page":"1093","DOI":"10.1287\/mnsc.30.9.1093","article-title":"Sequencing rules and due-date assignments in a job shop","volume":"30","author":"Baker","year":"1984","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(99)00389-6_BIB4","unstructured":"Baker, K.R., 1974. Introduction to Sequencing and Scheduling. Wiley, New York"},{"key":"10.1016\/S0377-2217(99)00389-6_BIB5","first-page":"21","article-title":"La distribution log-normale dans les probl\u00e8mes industriels","volume":"252","author":"Bernad","year":"1973","journal-title":"Production et Gestion"},{"key":"10.1016\/S0377-2217(99)00389-6_BIB6","doi-asserted-by":"crossref","first-page":"B630","DOI":"10.1287\/mnsc.16.10.B630","article-title":"A heuristic algorithm for the n job m machine sequencing problem","volume":"16","author":"Campbell","year":"1970","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(99)00389-6_BIB7","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/S0377-2217(82)80007-6","article-title":"The one machine problem","volume":"11","author":"Carlier","year":"1982","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00389-6_BIB8","first-page":"189","article-title":"A review of artificial intelligence-based job-shop scheduling systems","volume":"3","author":"Charalambous","year":"1991","journal-title":"Information and Decision Technologies"},{"key":"10.1016\/S0377-2217(99)00389-6_BIB9","unstructured":"Christofides, N., Mingozzi, A., Toth, P., Sandi, C., 1979. Combinatorial Optimisation. Wiley, New York"},{"key":"10.1016\/S0377-2217(99)00389-6_BIB10","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF02023076","article-title":"Applying tabu search to the job-shop scheduling problem","volume":"41","author":"Dell'Amico","year":"1993","journal-title":"Annals of Operation Research"},{"key":"10.1016\/S0377-2217(99)00389-6_BIB11","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/S0377-2217(97)00129-X","article-title":"Reduction of job-shop problems to flow-shop problems with precedence constraints","volume":"109","author":"Guinet","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(99)00389-6_BIB12","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1002\/nav.3800030307","article-title":"An extension of Johnson's results on job lot scheduling","volume":"3","author":"Jackson","year":"1956","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(99)00389-6_BIB13","unstructured":"Jackson, J.R., 1955. Scheduling a production line to minimise maximum tardiness. Research Report 43, University of California, Los Angeles"},{"key":"10.1016\/S0377-2217(99)00389-6_BIB14","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","article-title":"Optimal two- and three-stage production schedules with set-up times included","volume":"1","author":"Johnson","year":"1954","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(99)00389-6_BIB15","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/opre.25.1.45","article-title":"A survey of scheduling rules","volume":"25","author":"Panwalkar","year":"1977","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(99)00389-6_BIB16","unstructured":"Pinedo, M., 1995. Scheduling, Theory, Algorithms, and Systems. Prentice Hall, Englewood Cliffs, NJ"},{"key":"10.1016\/S0377-2217(99)00389-6_BIB17","unstructured":"Proust, C., Ferreira, A., Bijaoui, J., 1991. The inter-programming paradox: The diversity of softwares for an effective integration. In: International Congress of Industrial Engineering, Tours, pp. 1157\u20131166"},{"key":"10.1016\/S0377-2217(99)00389-6_BIB18","unstructured":"Rinnooy Kan, A.H.G., 1976. Machine Scheduling Problem: Classification, Complexity and Computations. Nijhoff, The Hague"},{"key":"10.1016\/S0377-2217(99)00389-6_BIB19","doi-asserted-by":"crossref","first-page":"1495","DOI":"10.1287\/mnsc.38.10.1495","article-title":"New search spaces for sequencing problems with application to job shop scheduling","volume":"38","author":"Storer","year":"1992","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(99)00389-6_BIB20","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1080\/00207548308942406","article-title":"Sequency on two and three machines with set-up, processing and removal times separated","volume":"21","author":"Sule","year":"1983","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(99)00389-6_BIB21","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.40.1.113","article-title":"Job-shop scheduling by simulated annealing","volume":"40","author":"Laarhoven","year":"1992","journal-title":"Operation Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799003896?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221799003896?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T06:53:18Z","timestamp":1555829598000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221799003896"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,9]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,9]]}},"alternative-id":["S0377221799003896"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(99)00389-6","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2000,9]]}}}