{"id":"https://openalex.org/W1484160090","doi":"https://doi.org/10.1007/11925231_42","title":"A New Algorithm That Obtains an Approximation of the Critical Path in the Job Shop Scheduling Problem","display_name":"A New Algorithm That Obtains an Approximation of the Critical Path in the Job Shop Scheduling Problem","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1484160090","doi":"https://doi.org/10.1007/11925231_42","mag":"1484160090"},"language":"en","primary_location":{"id":"doi:10.1007/11925231_42","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11925231_42","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5065675599","display_name":"Marco Antonio Cruz\u2010Ch\u00e1vez","orcid":"https://orcid.org/0000-0001-9967-3886"},"institutions":[{"id":"https://openalex.org/I884181516","display_name":"Universidad Aut\u00f3noma del Estado de Morelos","ror":"https://ror.org/03rzb4f20","country_code":"MX","type":"education","lineage":["https://openalex.org/I884181516"]}],"countries":["MX"],"is_corresponding":false,"raw_author_name":"Marco Antonio Cruz-Ch\u00e1vez","raw_affiliation_strings":["CIICAp, Autonomous University of Morelos State, Av. Universidad 1001, Chamilpa, 62209, Cuernavaca Morelos, M\u00e9xico"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CIICAp, Autonomous University of Morelos State, Av. Universidad 1001, Chamilpa, 62209, Cuernavaca Morelos, M\u00e9xico","institution_ids":["https://openalex.org/I884181516"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021222428","display_name":"Juan Frausto\u2013Sol\u00eds","orcid":"https://orcid.org/0000-0001-9307-0734"},"institutions":[{"id":"https://openalex.org/I98461037","display_name":"Tecnol\u00f3gico de Monterrey","ror":"https://ror.org/03ayjn504","country_code":"MX","type":"education","lineage":["https://openalex.org/I98461037"]}],"countries":["MX"],"is_corresponding":false,"raw_author_name":"Juan Frausto-Sol\u00eds","raw_affiliation_strings":["Department of Computer Science, ITESM, Campus Cuernavaca, Paseo de la Reforma 182-A, Lomas de Cuernavaca, 62589, Temixco, Morelos, M\u00e9xico"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, ITESM, Campus Cuernavaca, Paseo de la Reforma 182-A, Lomas de Cuernavaca, 62589, Temixco, Morelos, M\u00e9xico","institution_ids":["https://openalex.org/I98461037"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.04987699,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"450","last_page":"460"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":1.0,"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":1.0,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9975000023841858,"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.9922999739646912,"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/critical-path-method","display_name":"Critical path method","score":0.8791060447692871},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6888051629066467},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.599173903465271},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.5415598750114441},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5084935426712036},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49257808923721313},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4602580964565277},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4571911692619324},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.45601749420166016},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4221011996269226},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4149567484855652},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.3793487548828125},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2188902497291565},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.16765883564949036},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.09200170636177063}],"concepts":[{"id":"https://openalex.org/C115874739","wikidata":"https://www.wikidata.org/wiki/Q825377","display_name":"Critical path method","level":2,"score":0.8791060447692871},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6888051629066467},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.599173903465271},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.5415598750114441},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5084935426712036},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49257808923721313},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4602580964565277},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4571911692619324},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.45601749420166016},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4221011996269226},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4149567484855652},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3793487548828125},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2188902497291565},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16765883564949036},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.09200170636177063},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/11925231_42","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11925231_42","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6800000071525574,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W155266501","https://openalex.org/W1489178866","https://openalex.org/W1543299907","https://openalex.org/W1557245438","https://openalex.org/W1634141444","https://openalex.org/W1871275125","https://openalex.org/W1965602396","https://openalex.org/W1969972122","https://openalex.org/W2034627190","https://openalex.org/W2049967755","https://openalex.org/W2081278763","https://openalex.org/W2102218873","https://openalex.org/W2124865991","https://openalex.org/W2157846217","https://openalex.org/W2174003853","https://openalex.org/W2614478588","https://openalex.org/W2751335644"],"related_works":["https://openalex.org/W4293167680","https://openalex.org/W2776102956","https://openalex.org/W4382866750","https://openalex.org/W4387185483","https://openalex.org/W2022506245","https://openalex.org/W2040572217","https://openalex.org/W2388410942","https://openalex.org/W4385965963","https://openalex.org/W2600678155","https://openalex.org/W2018146256"],"abstract_inverted_index":null,"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}