{"id":"https://openalex.org/W2071306171","doi":"https://doi.org/10.1287/ijoc.3.2.149","title":"A Computational Study of the Job-Shop Scheduling Problem","display_name":"A Computational Study of the Job-Shop Scheduling Problem","publication_year":1991,"publication_date":"1991-05-01","ids":{"openalex":"https://openalex.org/W2071306171","doi":"https://doi.org/10.1287/ijoc.3.2.149","mag":"2071306171"},"language":"en","primary_location":{"id":"doi:10.1287/ijoc.3.2.149","is_oa":false,"landing_page_url":"https://doi.org/10.1287/ijoc.3.2.149","pdf_url":null,"source":{"id":"https://openalex.org/S165318533","display_name":"INFORMS journal on computing","issn_l":"0899-1499","issn":["0899-1499","1091-9856","1526-5528","2326-3245"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-a","cwts-core","jufo-1","norway-1"],"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ORSA Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071051767","display_name":"David Applegate","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Applegate","raw_affiliation_strings":["School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017655245","display_name":"William J. Cook","orcid":"https://orcid.org/0000-0002-6732-9471","observed_orcids":["https://orcid.org/0000-0002-6732-9471"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"William Cook","raw_affiliation_strings":["Combinatorics and Optimization Research Group, Bellcore, P.O. Box 1910, Morristown, NJ 07960-1919"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Combinatorics and Optimization Research Group, Bellcore, P.O. Box 1910, Morristown, NJ 07960-1919","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":26.3352,"has_fulltext":false,"cited_by_count":914,"citation_normalized_percentile":{"value":0.9975205,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"3","issue":"2","first_page":"149","last_page":"156"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9932000041007996,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9905999898910522,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.713370144367218},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.6631755232810974},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6003482937812805},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5710811018943787},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.561694324016571},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.535993218421936},{"id":"https://openalex.org/keywords/combinatorial-algorithms","display_name":"Combinatorial algorithms","score":0.5305004119873047},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.522296667098999},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.5191611051559448},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.43566280603408813},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.42355233430862427},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3864414095878601},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34409964084625244},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3121984004974365},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.22588002681732178}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.713370144367218},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.6631755232810974},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6003482937812805},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5710811018943787},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.561694324016571},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.535993218421936},{"id":"https://openalex.org/C2988809283","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Combinatorial algorithms","level":2,"score":0.5305004119873047},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.522296667098999},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.5191611051559448},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.43566280603408813},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.42355233430862427},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3864414095878601},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34409964084625244},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3121984004974365},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.22588002681732178},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1287/ijoc.3.2.149","is_oa":false,"landing_page_url":"https://doi.org/10.1287/ijoc.3.2.149","pdf_url":null,"source":{"id":"https://openalex.org/S165318533","display_name":"INFORMS journal on computing","issn_l":"0899-1499","issn":["0899-1499","1091-9856","1526-5528","2326-3245"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-a","cwts-core","jufo-1","norway-1"],"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ORSA Journal on Computing","raw_type":"journal-article"},{"id":"pmh:hdl:10068/178756","is_oa":false,"landing_page_url":"http://hdl.handle.net/10068/178756","pdf_url":null,"source":{"id":"https://openalex.org/S4377196900","display_name":"OpenGrey (Institut de l'Information Scientifique et Technique)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I1295345811","host_organization_name":"Institut de l'Information Scientifique et Technique","host_organization_lineage":["https://openalex.org/I1295345811"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"I - Miscellaneous"},{"id":"pmh:hdl:10068/226963","is_oa":false,"landing_page_url":"http://hdl.handle.net/10068/226963","pdf_url":null,"source":{"id":"https://openalex.org/S4377196900","display_name":"OpenGrey (Institut de l'Information Scientifique et Technique)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I1295345811","host_organization_name":"Institut de l'Information Scientifique et Technique","host_organization_lineage":["https://openalex.org/I1295345811"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"I - Miscellaneous"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.7099999785423279}],"x_sdgs":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W187987682","https://openalex.org/W2185192838","https://openalex.org/W2069961172","https://openalex.org/W2955323683","https://openalex.org/W1564838499","https://openalex.org/W2559484340","https://openalex.org/W26892725","https://openalex.org/W1971939018","https://openalex.org/W3155166764","https://openalex.org/W2140584489"],"abstract_inverted_index":{"The":[0],"job-shop":[1],"scheduling":[2],"problem":[3,8,111],"is":[4],"a":[5,20,62,72,79,87,128],"notoriously":[6],"difficult":[7],"in":[9,29,120],"combinatorial":[10,88,102],"optimization.":[11],"Although":[12],"even":[13],"modest":[14],"sized":[15],"instances":[16],"remain":[17],"computationally":[18],"intractable,":[19],"number":[21,63],"of":[22,61,64,112,124],"important":[23],"algorithmic":[24],"advances":[25],"have":[26,68],"been":[27],"made":[28],"recent":[30],"years":[31],"by":[32],"J.":[33,40,46,48,113],"Adams,":[34],"E.":[35,43],"Balas":[36],"and":[37,42,51,57,70,86,90,100,104,116],"D.":[38],"Zawack;":[39],"Carlier":[41],"Pinson;":[44],"B.":[45],"Lageweg,":[47],"K.":[49],"Lenstra":[50],"A.":[52],"H.":[53],"G.":[54,117],"Rinnooy":[55],"Kan;":[56],"others.":[58],"Making":[59],"use":[60],"these":[65],"advances,":[66],"we":[67],"designed":[69],"implemented":[71],"new":[73],"heuristic":[74,98],"procedure":[75],"for":[76,82],"finding":[77],"schedules,":[78],"cutting-plane":[80],"method":[81,99],"obtaining":[83],"lower":[84],"bounds,":[85],"branch":[89,103],"bound":[91,105],"algorithm.":[92],"Our":[93],"optimization":[94],"procedure,":[95],"combining":[96],"the":[97,101,108],"algorithm,":[106],"solved":[107],"well-known":[109],"10\u00d710":[110],"F.":[114],"Muth":[115],"L.":[118],"Thomson":[119],"under":[121,149],"7":[122],"minutes":[123],"computation":[125],"time":[126],"on":[127,134,143],"Sun":[129],"Sparcstation":[130],"1.":[131],"INFORMS":[132],"Journal":[133,142],"Computing,":[135],"ISSN":[136,150],"1091-9856,":[137],"was":[138],"published":[139],"as":[140],"ORSA":[141],"Computing":[144],"from":[145],"1989":[146],"to":[147],"1995":[148],"0899-1499.":[151]},"counts_by_year":[{"year":2026,"cited_by_count":20},{"year":2025,"cited_by_count":23},{"year":2024,"cited_by_count":32},{"year":2023,"cited_by_count":42},{"year":2022,"cited_by_count":41},{"year":2021,"cited_by_count":36},{"year":2020,"cited_by_count":35},{"year":2019,"cited_by_count":35},{"year":2018,"cited_by_count":25},{"year":2017,"cited_by_count":19},{"year":2016,"cited_by_count":15},{"year":2015,"cited_by_count":25},{"year":2014,"cited_by_count":28},{"year":2013,"cited_by_count":28},{"year":2012,"cited_by_count":36}],"updated_date":"2026-09-27T08:07:27.782135","created_date":"2025-10-10T00:00:00"}