{"id":"https://openalex.org/W1999466794","doi":"https://doi.org/10.1016/0305-0548(96)00016-0","title":"Low-complexity algorithms for sequencing jobs with a fixed number of job-classes","display_name":"Low-complexity algorithms for sequencing jobs with a fixed number of job-classes","publication_year":1996,"publication_date":"1996-11-01","ids":{"openalex":"https://openalex.org/W1999466794","doi":"https://doi.org/10.1016/0305-0548(96)00016-0","mag":"1999466794"},"language":"en","primary_location":{"id":"doi:10.1016/0305-0548(96)00016-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0305-0548(96)00016-0","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"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":"Computers & Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://pure.eur.nl/en/publications/4df2f833-4072-4b00-a67b-4bdd03c55e49","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5001418639","display_name":"Jack A.A. van der Veen","orcid":"https://orcid.org/0000-0003-4756-3831"},"institutions":[{"id":"https://openalex.org/I870178186","display_name":"Nyenrode Business University","ror":"https://ror.org/018528593","country_code":"NL","type":"education","lineage":["https://openalex.org/I870178186"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Jack A.A. van der Veen","raw_affiliation_strings":["Nijenrode University, The Netherlands Business School, Straatweg 25, 3621 BG Breukelen, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Nijenrode University, The Netherlands Business School, Straatweg 25, 3621 BG Breukelen, The Netherlands","institution_ids":["https://openalex.org/I870178186"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089542160","display_name":"Shuzhong Zhang","orcid":"https://orcid.org/0000-0001-5838-1676"},"institutions":[{"id":"https://openalex.org/I913958620","display_name":"Erasmus University Rotterdam","ror":"https://ror.org/057w15z03","country_code":"NL","type":"education","lineage":["https://openalex.org/I913958620"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Shuzhong Zhang","raw_affiliation_strings":["Econometric Institute, Erasmus University Rotterdam, P.O. Box 1738, 3000 DR Rotterdam, The Netherlands","Econometric Institute, Erasmus University Rotterdam P.O. Box 1738, 3000 DR Rotterdam, the Netherlands"],"affiliations":[{"raw_affiliation_string":"Econometric Institute, Erasmus University Rotterdam, P.O. Box 1738, 3000 DR Rotterdam, The Netherlands","institution_ids":["https://openalex.org/I913958620"]},{"raw_affiliation_string":"Econometric Institute, Erasmus University Rotterdam P.O. Box 1738, 3000 DR Rotterdam, the Netherlands","institution_ids":["https://openalex.org/I913958620"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5001418639"],"corresponding_institution_ids":["https://openalex.org/I870178186"],"apc_list":{"value":3210,"currency":"USD","value_usd":3210},"apc_paid":null,"fwci":3.4808,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.90673007,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"23","issue":"11","first_page":"1059","last_page":"1067"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.9987999796867371,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.991100013256073,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.6906554698944092},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6016248464584351},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5471504926681519},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5254829525947571},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47336384654045105},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.413822740316391},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4040650725364685},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.06633028388023376}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6906554698944092},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6016248464584351},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5471504926681519},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5254829525947571},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47336384654045105},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.413822740316391},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4040650725364685},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.06633028388023376},{"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/0305-0548(96)00016-0","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0305-0548(96)00016-0","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"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":"Computers & Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:pure.eur.nl:openaire_cris_publications/4df2f833-4072-4b00-a67b-4bdd03c55e49","is_oa":true,"landing_page_url":"https://pure.eur.nl/en/publications/4df2f833-4072-4b00-a67b-4bdd03c55e49","pdf_url":null,"source":{"id":"https://openalex.org/S4306401266","display_name":"EUR Research Repository (Erasmus University Rotterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I913958620","host_organization_name":"Erasmus University Rotterdam","host_organization_lineage":["https://openalex.org/I913958620"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Zhang, S & Veen, JAA 1996, 'Low-complexity algorithms for sequencing jobs with a fixed number of job-classes', Computers and Operations Research, vol. 23, no. 11, pp. 1059-1067. https://doi.org/10.1016/0305-0548(96)00016-0","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:eur:oai:repub.eur.nl:59984","is_oa":true,"landing_page_url":"http://hdl.handle.net/1765/59984","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computers & Operations Research, 23(11), 1059 - 1067","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:repub.eur.nl:59984","is_oa":true,"landing_page_url":"http://repub.eur.nl/pub/59984","pdf_url":null,"source":{"id":"https://openalex.org/S4377196287","display_name":"RePub (Erasmus University Rotterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I913958620","host_organization_name":"Erasmus University Rotterdam","host_organization_lineage":["https://openalex.org/I913958620"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computers & Operations Research vol. 23 no. 11, pp. 1059-1067","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.eur.nl:openaire_cris_publications/4df2f833-4072-4b00-a67b-4bdd03c55e49","is_oa":true,"landing_page_url":"https://pure.eur.nl/en/publications/4df2f833-4072-4b00-a67b-4bdd03c55e49","pdf_url":null,"source":{"id":"https://openalex.org/S4306401266","display_name":"EUR Research Repository (Erasmus University Rotterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I913958620","host_organization_name":"Erasmus University Rotterdam","host_organization_lineage":["https://openalex.org/I913958620"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Zhang, S & Veen, JAA 1996, 'Low-complexity algorithms for sequencing jobs with a fixed number of job-classes', Computers and Operations Research, vol. 23, no. 11, pp. 1059-1067. https://doi.org/10.1016/0305-0548(96)00016-0","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.6000000238418579}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W179567804","https://openalex.org/W249091067","https://openalex.org/W307896644","https://openalex.org/W1548540712","https://openalex.org/W1575077233","https://openalex.org/W1963547452","https://openalex.org/W1981403497","https://openalex.org/W2011039300","https://openalex.org/W2012251361","https://openalex.org/W2042706779","https://openalex.org/W2044060832","https://openalex.org/W2058937865","https://openalex.org/W2086091870","https://openalex.org/W2091519860","https://openalex.org/W2107481047","https://openalex.org/W2114616381","https://openalex.org/W2144931885","https://openalex.org/W2399100674","https://openalex.org/W3152126650","https://openalex.org/W4285719527","https://openalex.org/W4298262456","https://openalex.org/W6607233245"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W3172150420","https://openalex.org/W2107725657","https://openalex.org/W2112121444","https://openalex.org/W2509452605","https://openalex.org/W2148608945","https://openalex.org/W3112689649","https://openalex.org/W2998357381","https://openalex.org/W3204654320"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}