{"id":"https://openalex.org/W2019687552","doi":"https://doi.org/10.1016/s0304-3975(01)00293-6","title":"The convergence of stochastic algorithms solving flow shop scheduling","display_name":"The convergence of stochastic algorithms solving flow shop scheduling","publication_year":2002,"publication_date":"2002-08-01","ids":{"openalex":"https://openalex.org/W2019687552","doi":"https://doi.org/10.1016/s0304-3975(01)00293-6","mag":"2019687552"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(01)00293-6","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(01)00293-6","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","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/A5042428919","display_name":"Kathleen Steinh\u00f6fel","orcid":"https://orcid.org/0000-0002-9533-4649"},"institutions":[{"id":"https://openalex.org/I143379178","display_name":"FZI Research Center for Information Technology","ror":"https://ror.org/04kdh6x72","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I143379178"]},{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH","DE"],"is_corresponding":true,"raw_author_name":"K. Steinh\u00f6fel","raw_affiliation_strings":["GMD, National Research Center for Information Technology, Kekul\u00e9str. 7, D-12489 Berlin, Germany","Institute for Theoretical Computer Science, Swiss Federal Institute of Technology Zurich, CH-8092 Zurich, Switzerland"],"affiliations":[{"raw_affiliation_string":"GMD, National Research Center for Information Technology, Kekul\u00e9str. 7, D-12489 Berlin, Germany","institution_ids":["https://openalex.org/I143379178"]},{"raw_affiliation_string":"Institute for Theoretical Computer Science, Swiss Federal Institute of Technology Zurich, CH-8092 Zurich, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029149047","display_name":"Andreas Albrecht","orcid":"https://orcid.org/0000-0002-9813-4319"},"institutions":[{"id":"https://openalex.org/I141584323","display_name":"University of Hertfordshire","ror":"https://ror.org/0267vjk41","country_code":"GB","type":"education","lineage":["https://openalex.org/I141584323"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"A. Albrecht","raw_affiliation_strings":["Department of Computer Science, University of Hertfordshire, Hatfield, Herts AL10 9AB, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Hertfordshire, Hatfield, Herts AL10 9AB, UK","institution_ids":["https://openalex.org/I141584323"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078680760","display_name":"Chris K.C. Wong","orcid":"https://orcid.org/0000-0001-5449-5836"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"C.K. Wong","raw_affiliation_strings":["Department of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong","Department of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, N. T. Hong Kong"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong","institution_ids":["https://openalex.org/I177725633"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, N. T. Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5042428919"],"corresponding_institution_ids":["https://openalex.org/I143379178","https://openalex.org/I5124864"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.17489567,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"285","issue":"1","first_page":"101","last_page":"117"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9969000220298767,"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.9955999851226807,"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/maxima-and-minima","display_name":"Maxima and minima","score":0.6952873468399048},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6701433658599854},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5946880578994751},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5887046456336975},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5850550532341003},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.5731309056282043},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5045284032821655},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.485691636800766},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45963412523269653},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4373820424079895},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43294185400009155},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.4146379828453064}],"concepts":[{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.6952873468399048},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6701433658599854},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5946880578994751},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5887046456336975},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5850550532341003},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.5731309056282043},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5045284032821655},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.485691636800766},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45963412523269653},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4373820424079895},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43294185400009155},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.4146379828453064},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"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":4,"locations":[{"id":"doi:10.1016/s0304-3975(01)00293-6","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(01)00293-6","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:fraunhofer.de:N-38812","is_oa":false,"landing_page_url":"http://publica.fraunhofer.de/documents/N-38812.html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400801","display_name":"Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4923324","host_organization_name":"Fraunhofer-Gesellschaft","host_organization_lineage":["https://openalex.org/I4923324"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Fraunhofer FIRST","raw_type":"Journal Article"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/48c149d9-763e-40ce-8c0c-0fdcb04a5fd9","is_oa":false,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/48c149d9-763e-40ce-8c0c-0fdcb04a5fd9","pdf_url":null,"source":{"id":"https://openalex.org/S4306400216","display_name":"Research Portal (King's College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I183935753","host_organization_name":"King's College London","host_organization_lineage":["https://openalex.org/I183935753"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Steinhoefel, K K, Albrecht, A & Wong, C K 2002, 'The Convergence of Stochastic Algorithms Solving Flow Shop Scheduling Problems', Theoretical Computer Science, vol. 285, no. 1, pp. 101 - 117. https://doi.org/10.1016/S0304-3975(01)00293-6","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:publica.fraunhofer.de:publica/201271","is_oa":false,"landing_page_url":"https://publica.fraunhofer.de/handle/publica/201271","pdf_url":null,"source":{"id":"https://openalex.org/S4306400318","display_name":"Fraunhofer-Publica (Fraunhofer-Gesellschaft)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4923324","host_organization_name":"Fraunhofer-Gesellschaft","host_organization_lineage":["https://openalex.org/I4923324"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"journal article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7","score":0.8700000047683716}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1505903089","https://openalex.org/W1794786645","https://openalex.org/W1969070729","https://openalex.org/W1976586958","https://openalex.org/W2003146973","https://openalex.org/W2005228957","https://openalex.org/W2007315235","https://openalex.org/W2019704988","https://openalex.org/W2022719115","https://openalex.org/W2060160256","https://openalex.org/W2081278763","https://openalex.org/W2106371135","https://openalex.org/W2157846217","https://openalex.org/W2168555043","https://openalex.org/W2587256713","https://openalex.org/W4230058353"],"related_works":["https://openalex.org/W2132461435","https://openalex.org/W1992534732","https://openalex.org/W2185192838","https://openalex.org/W2967782293","https://openalex.org/W2955323683","https://openalex.org/W1564838499","https://openalex.org/W2069961172","https://openalex.org/W2559484340","https://openalex.org/W26892725","https://openalex.org/W2165758382"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-03-10T14:07:55.174380","created_date":"2025-10-10T00:00:00"}