{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T09:08:10Z","timestamp":1771578490119,"version":"3.50.1"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1997,11,1]],"date-time":"1997-11-01T00:00:00Z","timestamp":878342400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,11,1]],"date-time":"1997-11-01T00:00:00Z","timestamp":878342400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Heuristics"],"published-print":{"date-parts":[[1997,11]]},"DOI":"10.1023\/a:1009627429878","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T22:47:08Z","timestamp":1040597228000},"page":"111-137","source":"Crossref","is-referenced-by-count":79,"title":["A Computational Study of Shifting Bottleneck Procedures for Shop Scheduling Problems"],"prefix":"10.1007","volume":"3","author":[{"given":"Ebru","family":"Demirkol","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjay","family":"Mehta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reha","family":"Uzsoy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"143275_CR1","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1287\/ijoc.6.2.118","volume":"6","author":"E.H.L. Aarts","year":"1994","unstructured":"Aarts, E.H.L.,P.J.M. van Laarhoven, J.K. Lenstra, N.L.J. Ulder. (1994). \u201cA Computational Study of Local Search Algorithms for Job Shop Scheduling.\u201d ORSA Journal on Computing 6, 118\u2013125.","journal-title":"ORSA Journal on Computing"},{"key":"143275_CR2","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"3","author":"J. Adams","year":"1988","unstructured":"Adams, J., E. Balas, and D. Zawack. (1988). \u201cThe Shifting Bottleneck Procedure for Job Shop Scheduling.\u201d Management Science 3, 391\u2013401.","journal-title":"Management Science"},{"key":"143275_CR3","unstructured":"Ahuja, R.K., T.L. Magnanti, J.B. Orlin. (1993). Network Flows: Theory, Algorithms and Applications Prentice-Hall."},{"key":"143275_CR4","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","volume":"3","author":"D. Applegate","year":"1991","unstructured":"Applegate, D., and W. Cook. (1991). \u201cA Computational Study of Job Shop Scheduling.\u201d ORSA Journal on Computing 3, 149\u2013156.","journal-title":"ORSA Journal on Computing"},{"key":"143275_CR5","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1287\/opre.17.6.941","volume":"17","author":"E. Balas","year":"1969","unstructured":"Balas, E. (1969). \u201cMachine Sequencing via Disjunctive Graphs: An Implicit Enumeration Approach.\u201d Operations Research 17, 941\u2013957.","journal-title":"Operations Research"},{"key":"143275_CR6","volume-title":"Applications of Mathematical Programming Techniques","author":"E. Balas","year":"1970","unstructured":"Balas, E. (1970). \u201cProject Scheduling with Resource Constraints.\u201d In E.M.L. Beale (ed.) Applications of Mathematical Programming Techniques. London: The English Universities Press Ltd."},{"key":"143275_CR7","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1287\/mnsc.41.1.94","volume":"41","author":"E. Balas","year":"1995","unstructured":"Balas, E., J.K. Lenstra, and A. Vazacopoulos. (1995). \u201cThe One Machine Problem with Delayed Precedence Constraints and Its Use in Job Shop Scheduling.\u201d Management Science 41, 94\u2013109.","journal-title":"Management Science"},{"key":"143275_CR8","volume-title":"Dispatching,Chapter 83 of Handbook of Industrial Engineering","author":"K. Bhaskaran","year":"1991","unstructured":"Bhaskaran, K., and E. Pinedo. (1991). Dispatching,Chapter 83 of Handbook of Industrial Engineering, G. Salvendy (ed.) New York: J. Wiley."},{"key":"143275_CR9","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1080\/00207548208947745","volume":"20","author":"J.H. Blackstone","year":"1982","unstructured":"Blackstone, J.H., D.T. Phillips, and G.L. Hogg. (1982). \u201cA State-of-the-Art Survey of Dispatching Rules for Manufacturing Job Shop Operations.\u201d International Journal of Production Research 20, 27\u201345.","journal-title":"International Journal of Production Research"},{"key":"143275_CR10","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/S0377-2217(82)80007-6","volume":"11","author":"J. Carlier","year":"1982","unstructured":"Carlier, J. (1982). \u201cThe One Machine Sequencing Problem.\u201d European Journal of Operational Research 11, 42\u201347.","journal-title":"European Journal of Operational Research"},{"key":"143275_CR11","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1287\/mnsc.35.2.164","volume":"35","author":"J. Carlier","year":"1989","unstructured":"Carlier, J. and E. Pinson. (1989). \u201cAn Algorithm for Solving the Job-Shop Problem.\u201d Management Science 35, 164\u2013176.","journal-title":"Management Science"},{"key":"143275_CR12","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1016\/0377-2217(93)E0322-O","volume":"81","author":"S. Dauzere-Peres","year":"1995","unstructured":"Dauzere-Peres, S. (1995). \u201cAProcedure for the One Machine Sequencing Problem with Dependent Jobs.\u201d European Journal of Operational Research 81, 579\u2013589.","journal-title":"European Journal of Operational Research"},{"key":"143275_CR13","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1080\/00207549308956766","volume":"31","author":"S. Dauzere-Peres","year":"1993","unstructured":"Dauzere-Peres, S. and J.B. Lasserre. (1993). \u201cAModified Shifting Bottleneck Procedure for Job Shop Scheduling.\u201d International Journal of Production Research 31, 923\u2013932.","journal-title":"International Journal of Production Research"},{"key":"143275_CR14","unstructured":"Demirkol, E., S.V. Mehta, and R. Uzsoy. \u201cBenchmarks for Shop Scheduling Problems.\u201d European Journal of Operational Research(forthcoming)."},{"key":"143275_CR15","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0305-0548(93)E0016-M","volume":"22","author":"U. Dorndorf","year":"1996","unstructured":"Dorndorf, U., E. Pesch. (1996). \u201cEvolution-Based Learning in a Job Shop Scheduling Environment.\u201d Computers and Operations Research 22, 25\u201340.","journal-title":"Computers and Operations Research"},{"key":"143275_CR16","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: W.H. Freeman."},{"key":"143275_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/70.210791","volume":"9","author":"D.J. Hoitomt","year":"1993","unstructured":"Hoitomt, D.J., P.B. Luh, K.R. Pattipati. (1993). \u201cA Practical Approach to Job Shop-Scheduling Problems.\u201d IEEE Transactions on Robotics and Automation 9, 1\u201313.","journal-title":"IEEE Transactions on Robotics and Automation"},{"key":"143275_CR18","doi-asserted-by":"crossref","first-page":"666","DOI":"10.1057\/jors.1996.78","volume":"47","author":"H.H. Holtsclaw","year":"1996","unstructured":"Holtsclaw, H.H. and R. Uzsoy. (1996). \u201cMachine Criticality Measures and Subproblem Solution Procedures in Shifting Bottleneck Methods: A Computational Study.\u201d Journal of the Operational Research Society 47, 666\u2013677.","journal-title":"Journal of the Operational Research Society"},{"key":"143275_CR19","first-page":"46","volume":"11","author":"K. Kempf","year":"1991","unstructured":"Kempf, K., B. Russell, S. Sidhu, and S. Barrett. (1991). \u201cArtificially Intelligent Schedulers in Manufacturing Practice.\u201d AI Magazine 11, 46\u201356.","journal-title":"AI Magazine"},{"key":"143275_CR20","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1287\/mnsc.38.8.1201","volume":"38","author":"J.B. Lasserre","year":"1992","unstructured":"Lasserre, J.B. (1992). \u201cAn Integrated Model for Job Shop Planning and Scheduling.\u201d Management Science 38, 1201\u20131211.","journal-title":"Management Science"},{"key":"143275_CR21","doi-asserted-by":"crossref","unstructured":"Lawler, E.L., J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys. (1993). \u201cSequencing and Scheduling: Algorithms and Complexity}.\u201d In S.C. Graves, A.H.G. Rinnooy Kan, P. Zipkin (eds.), Handbooks in Operations Research and Management Science Vol. 4\n                  : Logistics of Production and Inventory. North-Holland.","DOI":"10.1016\/S0927-0507(05)80189-6"},{"key":"143275_CR22","unstructured":"Lawrence, S.R., S.E. Sewell. \u201cHeuristic versus Schedules When Processing Times are Uncertain.\u201d Journal of Operations Management(forthcoming)."},{"key":"143275_CR23","volume-title":"Sequencing by Enumerative Methods","author":"J.K. Lenstra","year":"1977","unstructured":"Lenstra, J.K. (1977). Sequencing by Enumerative Methods. Amsterdam: Mathematical Center Tract 69, Mathematisch Centrum."},{"key":"143275_CR24","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0377-2217(95)00012-F","volume":"83","author":"H. Lourenco","year":"1995","unstructured":"Lourenco, H. (1995). \u201cJob Shop Scheduling: Computational Study of Local Search and Large-Setup Optimization Methods.\u201d European Journal of Operational Research 83, 347\u2013364.","journal-title":"European Journal of Operational Research"},{"key":"143275_CR25","doi-asserted-by":"publisher","first-page":"1066","DOI":"10.1109\/9.231461","volume":"38","author":"P.B. Luh","year":"1993","unstructured":"Luh, P.B., D.J. Hoitomt. (1993). \u201cScheduling of Manufacturing Systems Using the Lagrangian Relaxation Technique.\u201d IEEE Transactions on Automatic Control 38, 1066\u20131079.","journal-title":"IEEE Transactions on Automatic Control"},{"key":"143275_CR26","volume-title":"A Controlled Search Simulated Annealing Approach for the General Job Shop Scheduling Problem","author":"H. Matsuo","year":"1988","unstructured":"Matsuo, H., C.J. Suh and R.S. Sullivan. (1988). \u201cA Controlled Search Simulated Annealing Approach for the General Job Shop Scheduling Problem.\u201d Department of Management, Graduate School of Business, University of Texas at Austin."},{"key":"143275_CR27","unstructured":"Mehta, S.V., R. Uzsoy. \u201cPredictable Scheduling of a Job Shop Subject to Breakdowns.\u201d IEEE Transactions on Robotics and Automation(forthcoming)."},{"key":"143275_CR28","volume-title":"Research Report","author":"T.E. Morton","year":"1984","unstructured":"Morton, T.E., R.M. Rachamadugu, A. Vepsalainen. (1984). \u201cAccurate Myopic Heuristics for Tardiness Scheduling.\u201d Research Report, Graduate School of Industrial Administration, Carnegie-Mellon University."},{"key":"143275_CR29","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E. Nowicki","year":"1996","unstructured":"Nowicki, E., C. Smutnicki. (1996). \u201cA Fast Taboo Search Algorithm for the Job Shop Problem.\u201d Management Science 42, 797\u2013813.","journal-title":"Management Science"},{"key":"143275_CR30","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1142\/S0960313192000157","volume":"2","author":"I.M. Ovacik","year":"1992","unstructured":"Ovacik, I.M. and R. Uzsoy. (1992). \u201cA Shifting Bottleneck Algorithm for Scheduling Semiconductor Testing Operations.\u201d Journal of Electronics Manufacturing 2, 119\u2013134.","journal-title":"Journal of Electronics Manufacturing"},{"key":"143275_CR31","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0278-6125(94)90023-X","volume":"13","author":"I.M. Ovacik","year":"1994","unstructured":"Ovacik, I.M. and R. Uzsoy. (1994). \u201cExploiting Shop Floor Status Information to Schedule Complex Job Shops.\u201d Journal of Manufacturing Systems 13, 73\u201384.","journal-title":"Journal of Manufacturing Systems"},{"key":"143275_CR32","volume-title":"Research Report","author":"I.M. Ovacik","year":"1995","unstructured":"Ovacik, I.M., R. Uzsoy. (1995). \u201cDecomposition Methods for Scheduling Semiconductor Testing Facilities.\u201d Research Report, School of Industrial Engineering, Purdue University."},{"key":"143275_CR33","doi-asserted-by":"crossref","unstructured":"Ovacik, I.M., R. Uzsoy. (1997). Decomposition Methods for Complex Factory Scheduling Problems. Kluwer Academic Publishers","DOI":"10.1007\/978-1-4615-6329-7"},{"key":"143275_CR34","doi-asserted-by":"crossref","unstructured":"Panwalkar, S.S., and W. Iskander. (1997). \u201cA Survey of Scheduling Rules.\u201d Operations Research 25, 45\u201361.","DOI":"10.1287\/opre.25.1.45"},{"key":"143275_CR35","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"M. Pinedo","year":"1995","unstructured":"Pinedo, M. (1995). Scheduling: Theory, Algorithms, and Systems. New Jersey: Prentice Hall."},{"key":"143275_CR36","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0305-0483(90)90017-4","volume":"18","author":"R. Ramasesh","year":"1990","unstructured":"Ramasesh, R. (1990). Dynamic Job Shop Scheduling: A Survey of Simulation Research, OMEGA 18, 43\u201357.","journal-title":"OMEGA"},{"key":"143275_CR37","volume-title":"Notes DS","author":"B. Roy","year":"1964","unstructured":"Roy, B. and B. Sussmann. (1964). Les Problems d'Ordonnancement avec Contraintes Disjonctives, Notes DS No. 9 bis, SEMA, Montrouge."},{"key":"143275_CR38","volume-title":"Ph.D. thesis","author":"N. Sadeh","year":"1991","unstructured":"Sadeh, N. (1991). Look-Ahead Techniques for Micro-Opportunistic Job Shop Scheduling. Ph.D. thesis, Pittsburgh, PA, School of Computer Science, Carnegie-Mellon University."},{"key":"143275_CR39","first-page":"1495","volume-title":"Working Paper LPOM-95-12","author":"J.M.J. Schutten","year":"1995","unstructured":"Schutten, J.M.J. (1995). \u201cPractical Job Shop Scheduling.\u201dWorking Paper LPOM-95-12, Laboratory of Production and Operations Management, Department of Mechanical Engineering, University of Twente, The Netherlands"},{"key":"143275_CR40","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1287\/mnsc.38.10.1495","volume":"38","author":"R.H. Storer","year":"1992","unstructured":"Storer, R.H., S.D. Wu, and R. Vaccari. (1992). \u201cNew Search Spaces for Sequencing Problems with Applicationto Job Shop Scheduling.\u201d Management Science 38, 1495-1509.","journal-title":"Management Science"},{"key":"143275_CR41","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1287\/ijoc.7.4.453","volume":"7","author":"R.H. Storer","year":"1995","unstructured":"Storer, R.H., S.D. Wu, and R. Vaccari. (1995). \u201cProblem and Heuristic Space Search Strategies for Job Shop Scheduling.\u201d ORSA Journal on Computing 7, 453\u2013467.","journal-title":"ORSA Journal on Computing"},{"key":"143275_CR42","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. (1993). \u201cBenchmarks for Basic Scheduling Problems.\u201d European Journal of Operational Research 64, 278\u2013285.","journal-title":"European Journal of Operational Research"},{"key":"143275_CR43","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. (1994). \u201cParallel Taboo Search Techniques for the Job Shop Scheduling Problem.\u201d ORSA Journal on Computing 6, 108\u2013117.","journal-title":"ORSA Journal on Computing"},{"key":"143275_CR44","first-page":"47","volume":"24","author":"R. Uzsoy","year":"1992","unstructured":"Uzsoy, R., C.-Y. Lee, and L.A. Martin-Vega. (1992). \u201cA Review of Production Planning and Scheduling Models in the Semiconductor Industry, Part I: System Characteristics, Performance Evaluation and Production Planning.\u201d IIE Transactions on Scheduling and Logistics 24, 47\u201359.","journal-title":"IIE Transactions on Scheduling and Logistics"},{"key":"143275_CR45","first-page":"44","volume":"26","author":"R. Uzsoy","year":"1994","unstructured":"Uzsoy, R., C.Y. Lee, and L.A. Martin-Vega. (1994). \u201cA Survey of Production Planning and Scheduling Models in the Semiconductor Industry, Part II: Shop-Floor Control.\u201d IIE Transactions on Scheduling and Logistics 26, 44\u201345.","journal-title":"IIE Transactions on Scheduling and Logistics"},{"key":"143275_CR46","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1287\/opre.40.1.113","volume":"40","author":"P.J.M. Van Laarhoven","year":"1992","unstructured":"Van Laarhoven, P.J.M., E.H.L. Aarts, and J.K. Lenstra. (1992). \u201cJob Shop Scheduling by Simulated Annealing.\u201d Operations Research 40, 113\u2013125.","journal-title":"Operations Research"},{"key":"143275_CR47","first-page":"102","volume":"1","author":"A.P.L. Vepsalainen","year":"1988","unstructured":"Vepsalainen, A.P.L. and T.E. Morton. (1988). \u201cImproving Local Priority Rules Global Lead-Time Estimates: A Simulation Study.\u201d Journal of Manufacturing and Operations Management 1, 102\u2013118.","journal-title":"Journal of Manufacturing and Operations Management"},{"key":"143275_CR48","doi-asserted-by":"publisher","first-page":"2187","DOI":"10.1080\/00207549008942861","volume":"28","author":"K.P. White","year":"1990","unstructured":"White, K.P. and V.R. Rogers. (1990). \u201cJob-shop Scheduling: Limits of the Binary Disjunctive Formulation.\u201d International Journal of Production Research 28, 2187\u20132200.","journal-title":"International Journal of Production Research"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009627429878.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009627429878\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009627429878.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T10:49:43Z","timestamp":1747651783000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009627429878"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,11]]},"references-count":48,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,11]]}},"alternative-id":["143275"],"URL":"https:\/\/doi.org\/10.1023\/a:1009627429878","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,11]]}}}