{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T03:06:49Z","timestamp":1770520009484,"version":"3.49.0"},"reference-count":54,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,8,1]],"date-time":"1998-08-01T00:00:00Z","timestamp":901929600000},"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":[[1998,8]]},"DOI":"10.1016\/s0377-2217(97)00129-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:10:52Z","timestamp":1027609852000},"page":"96-110","source":"Crossref","is-referenced-by-count":14,"title":["Reduction of job-shop problems to flow-shop problems with precedence constraints"],"prefix":"10.1016","volume":"109","author":[{"given":"Alain","family":"Guinet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marie","family":"Legrand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00129-X_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(97)00129-X_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(97)00129-X_BIB3","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","article-title":"A computational study of job-shop scheduling","volume":"3","author":"Applegate","year":"1991","journal-title":"ORSA Journal of Computing"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB4","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(97)00129-X_BIB5","series-title":"Introduction to Sequencing and Scheduling","author":"Baker","year":"1974"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB6","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1287\/opre.17.6.941","article-title":"Machine sequencing via disjunctive graphs: An implicit enumeration algorithm","volume":"17","author":"Balas","year":"1969","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB7","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1287\/mnsc.31.5.594","article-title":"Scheduling the general job shop","volume":"31","author":"Barker","year":"1985","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB8","first-page":"21","article-title":"La distribution log-normale dans les probl\u00e8mes industriels","volume":"252","author":"Bernard","year":"1973","journal-title":"Production et Gestion"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB9","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF02276919","article-title":"An efficient algorithm for the job-shop problem with two jobs","volume":"40","author":"Brucker","year":"1988","journal-title":"Computing"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB10","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF02277185","article-title":"Minimizing maximum lateness in a two machine unit-time job shop","volume":"27","author":"Brucker","year":"1981","journal-title":"Computing"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB11","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(97)00129-X_BIB12","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/0377-2217(94)90379-4","article-title":"Adjustment of heads and tails for the job shop problem","volume":"78","author":"Carlier","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB13","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","article-title":"An algorithm for solving the job shop problem","volume":"35","author":"Carlier","year":"1989","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB14","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(97)00129-X_BIB15","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(97)00129-X_BIB16","series-title":"Combinatorial Optimization","author":"Christofides","year":"1979"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB17","doi-asserted-by":"crossref","first-page":"1174","DOI":"10.1287\/mnsc.23.11.1174","article-title":"An evaluation of Flow shop sequencing heuristics","volume":"23","author":"Dannenbring","year":"1977","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB18","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(97)00129-X_BIB19","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0166-218X(83)90016-1","article-title":"Surrogate duality relaxation for job-shop scheduling","volume":"5","author":"Fisher","year":"1983","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB20","series-title":"Sequencing and Scheduling, An Introduction to the Mathematics of the Job-Shop","author":"French","year":"1982"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB21","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/opre.26.1.36","article-title":"flow-shop and job-shop schedules: Complexity and approximation","volume":"26","author":"Gonzalez","year":"1978","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB22","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1057\/jors.1983.142","article-title":"On flow-shop scheduling with release and due dates to minimize maximum lateness","volume":"34","author":"Grabowski","year":"1983","journal-title":"Journal of Operational Research Society"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB23","first-page":"133","article-title":"On two machine scheduling with release and due dates to minimize maximum lateness","volume":"17","author":"Grabowski","year":"1980","journal-title":"Opsearch"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB24","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1287\/opre.29.4.646","article-title":"A review of production scheduling","volume":"29","author":"Graves","year":"1981","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB25","doi-asserted-by":"crossref","first-page":"1643","DOI":"10.1080\/00207549608904988","article-title":"Scheduling hybrid flowshops to minimize tardiness or maximum completion time","volume":"34","author":"Guinet","year":"1996","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB26","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1057\/jors.1971.18","article-title":"A functional heuristic algithm for the flow-shop scheduling problem","volume":"22","author":"Gupta","year":"1971","journal-title":"Operation Research Quarterly"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB27","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/0377-2217(86)90037-8","article-title":"The two-machine sequence dependent flow-shop scheduling problem","volume":"24","author":"Gupta","year":"1986","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB28","first-page":"655","article-title":"A geometric method and a graphical algorithm for a sequencing problem","volume":"12","author":"Hardgrave","year":"1963","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB29","doi-asserted-by":"crossref","first-page":"1119","DOI":"10.1080\/00207548808947922","article-title":"An extension of Palmer's heuristic for the flow-shop scheduling problem","volume":"26","author":"Hundal","year":"1988","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB30","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(97)00129-X_BIB31","article-title":"Scheduling a production line to minimize maximum tardiness","author":"Jackson","year":"1955"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB32","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/nav.3800010110","article-title":"Optimal two and three-stage production schedules with setup times included","volume":"1","author":"Johnson","year":"1954","journal-title":"Naval Research Logistics Quarterly"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB33","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1287\/mnsc.24.4.441","article-title":"Job shop scheduling by implicit enumeration","volume":"24","author":"Lageweg","year":"1977","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB34","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BF01584089","article-title":"A solvable case of the travelling salesman problem","volume":"1","author":"Lawler","year":"1971","journal-title":"Mathematics Programming"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB35","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1057\/jors.1992.162","article-title":"An improved formulation for the job-shop scheduling problem","volume":"43","author":"Liao","year":"1992","journal-title":"Journal of Operational Research Society"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB36","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1080\/00207549308956713","article-title":"Addressing the gap in scheduling research: A review of optimization and heuristic methods in production scheduling","volume":"31","author":"MacCarthy","year":"1993","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB37","series-title":"Proc. Fourth Int. Conf. on Genetic Algorithms","first-page":"474","article-title":"Conventional genetic algorithm for job-shop problems","author":"Nakado","year":"1991"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB38","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1287\/opre.27.4.792","article-title":"The two-machine maximum flow-time problem with series-parallel precedence constraints: An algorithm and extensions","volume":"27","author":"Monma","year":"1979","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB39","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","article-title":"A heuristic algorithm for the m machine n job flow-shop sequencing problem","volume":"11","author":"Nawaz","year":"1983","journal-title":"Omega"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB40","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1057\/jors.1965.8","article-title":"Sequencing jobs through a multi stage process in the minimum total time. A quick method of obtaining a near optimum","volume":"16","author":"Palmer","year":"1965","journal-title":"Operation Research Quarterly"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB41","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1057\/jors.1979.160","article-title":"Flow-shop scheduling problems with no in-process waiting: A special case","volume":"30","author":"Panwalkar","year":"1979","journal-title":"Journal of Operational Research Society"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB42","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(97)00129-X_BIB43","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1080\/00207548408942436","article-title":"A survey and evaluation of static flow-shop scheduling heuristics","volume":"22","author":"Park","year":"1984","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB44","series-title":"Summer School on scheduling theory and its applications","first-page":"297","article-title":"Using Johnson's algorithm for solving flow-shop problems","author":"Proust","year":"1982"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB45","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1080\/00207549108930084","article-title":"Flow-shop scheduling with setup processing and removal times separated","volume":"29","author":"Proust","year":"1991","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB46","series-title":"International Congress of Industrial Engineering","first-page":"1157","article-title":"The interprogramming paradox: The diversity of softwares for an effective integration","author":"Proust","year":"1991"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB47","series-title":"Machine Scheduling Problem: Classification, Complexity and Computations","author":"Rinnooy Kan","year":"1976"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB48","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1287\/opre.27.4.782","article-title":"The two-machine maximum flow time problem with series parallel precedence relations","volume":"27","author":"Sidney","year":"1979","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB49","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1287\/mnsc.21.5.544","article-title":"Flow-shop sequencing problem with ordered time matrices","volume":"21","author":"Smith","year":"1975","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB50","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(97)00129-X_BIB51","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1080\/00207548308942406","article-title":"Sequency on two and three machines with setup, processing and removal times separated","volume":"21","author":"Sule","year":"1983","journal-title":"International Journal of Production Research"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB52","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1287\/mnsc.29.4.477","article-title":"Flow shop problems with time lags","volume":"29","author":"Szwarc","year":"1983","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB53","doi-asserted-by":"crossref","first-page":"1016","DOI":"10.1287\/mnsc.23.9.1016","article-title":"Sequencing n jobs on m machines to minimize tardiness: A branch and bound solution","volume":"23","author":"Townsend","year":"1977","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00129-X_BIB54","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1287\/opre.40.1.113","article-title":"Jobshop scheduling by simulated annealing","volume":"40","author":"Van 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:S037722179700129X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722179700129X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T19:50:33Z","timestamp":1555962633000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S037722179700129X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,8]]},"references-count":54,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,8]]}},"alternative-id":["S037722179700129X"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00129-x","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1998,8]]}}}