{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,13]],"date-time":"2026-11-13T03:22:57Z","timestamp":1794540177978,"version":"4.9.1"},"reference-count":0,"publisher":"Institute for Operations Research and the Management Sciences (INFORMS)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ORSA Journal on Computing"],"published-print":{"date-parts":[[1991,5]]},"abstract":"<jats:p>The job-shop scheduling problem is a notoriously difficult problem in combinatorial optimization. Although even modest sized instances remain computationally intractable, a number of important algorithmic advances have been made in recent years by J. Adams, E. Balas and D. Zawack; J. Carlier and E. Pinson; B. J. Lageweg, J. K. Lenstra and A. H. G. Rinnooy Kan; and others. Making use of a number of these advances, we have designed and implemented a new heuristic procedure for finding schedules, a cutting-plane method for obtaining lower bounds, and a combinatorial branch and bound algorithm. Our optimization procedure, combining the heuristic method and the combinatorial branch and bound algorithm, solved the well-known 10\u00d710 problem of J. F. Muth and G. L. Thomson in under 7 minutes of computation time on a Sun Sparcstation 1.<\/jats:p>\n                  <jats:p>INFORMS Journal on Computing, ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.<\/jats:p>","DOI":"10.1287\/ijoc.3.2.149","type":"journal-article","created":{"date-parts":[[2008,10,31]],"date-time":"2008-10-31T18:41:23Z","timestamp":1225478483000},"page":"149-156","source":"Crossref","is-referenced-by-count":674,"title":["A Computational Study of the Job-Shop Scheduling Problem"],"prefix":"10.1287","volume":"3","author":[{"given":"David","family":"Applegate","sequence":"first","affiliation":[{"name":"School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"William","family":"Cook","sequence":"additional","affiliation":[{"name":"Combinatorics and Optimization Research Group, Bellcore, P.O. Box 1910, Morristown, NJ 07960-1919"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"109","container-title":["ORSA Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/pubsonline.informs.org\/doi\/pdf\/10.1287\/ijoc.3.2.149","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T07:25:54Z","timestamp":1680420354000},"score":1,"resource":{"primary":{"URL":"https:\/\/pubsonline.informs.org\/doi\/10.1287\/ijoc.3.2.149"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":0,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["10.1287\/ijoc.3.2.149"],"URL":"https:\/\/doi.org\/10.1287\/ijoc.3.2.149","relation":{},"ISSN":["0899-1499","2326-3245"],"issn-type":[{"value":"0899-1499","type":"print"},{"value":"2326-3245","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,5]]}}}