{"id":"https://openalex.org/W2060023372","doi":"https://doi.org/10.1016/s0167-6377(00)00053-5","title":"Semi-online scheduling with decreasing job sizes","display_name":"Semi-online scheduling with decreasing job sizes","publication_year":2000,"publication_date":"2000-12-01","ids":{"openalex":"https://openalex.org/W2060023372","doi":"https://doi.org/10.1016/s0167-6377(00)00053-5","mag":"2060023372"},"language":"en","primary_location":{"id":"doi:10.1016/s0167-6377(00)00053-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0167-6377(00)00053-5","pdf_url":null,"source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"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":"Operations Research Letters","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/A5109048821","display_name":"Steve Seiden","orcid":null},"institutions":[{"id":"https://openalex.org/I121820613","display_name":"Louisiana State University","ror":"https://ror.org/05ect4e57","country_code":"US","type":"education","lineage":["https://openalex.org/I121820613"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Steve Seiden","raw_affiliation_strings":["Department of Computer Science, Louisiana State University, 298 Coates Hall, Baton Rouge, LA 70803, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Louisiana State University, 298 Coates Hall, Baton Rouge, LA 70803, USA","institution_ids":["https://openalex.org/I121820613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061997850","display_name":"Ji\u0159\u0131\u0301 Sgall","orcid":"https://orcid.org/0000-0003-3658-4848"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]},{"id":"https://openalex.org/I4210120266","display_name":"Czech Academy of Sciences, Institute of Mathematics","ror":"https://ror.org/02tv1yf50","country_code":"CZ","type":"facility","lineage":["https://openalex.org/I202391551","https://openalex.org/I4210120266"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Ji\u0159\u0131\u0301 Sgall","raw_affiliation_strings":["Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University, Praha, Czech Republic","Mathematical Institute, AS CR, \u017ditn\u00e1 25, CZ-11567 Praha 1, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University, Praha, Czech Republic","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Mathematical Institute, AS CR, \u017ditn\u00e1 25, CZ-11567 Praha 1, Czech Republic","institution_ids":["https://openalex.org/I4210120266"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080746477","display_name":"Gerhard J. Woeginger","orcid":"https://orcid.org/0000-0001-8816-2693"},"institutions":[{"id":"https://openalex.org/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Gerhard Woeginger","raw_affiliation_strings":["Institut f\u00fcr Mathematik, Technische Universit\u00e4t Graz, Steyrergasse 30, A-8010 Graz, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Mathematik, Technische Universit\u00e4t Graz, Steyrergasse 30, A-8010 Graz, Austria","institution_ids":["https://openalex.org/I4092182"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5109048821"],"corresponding_institution_ids":["https://openalex.org/I121820613"],"apc_list":{"value":2760,"currency":"USD","value_usd":2760},"apc_paid":null,"fwci":14.2804,"has_fulltext":false,"cited_by_count":104,"citation_normalized_percentile":{"value":0.98999411,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"27","issue":"5","first_page":"215","last_page":"221"},"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.9998999834060669,"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/T12176","display_name":"Optimization and Packing Problems","score":0.980400025844574,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.7971194982528687},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.70941561460495},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6867790222167969},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6151189804077148},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5425773859024048},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.5169417262077332},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5141849517822266},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.4912516474723816},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.45663952827453613},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43036967515945435},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.41744357347488403},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40769606828689575},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36595070362091064},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36294054985046387},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.12195822596549988}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7971194982528687},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.70941561460495},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6867790222167969},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6151189804077148},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5425773859024048},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.5169417262077332},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5141849517822266},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.4912516474723816},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.45663952827453613},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43036967515945435},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.41744357347488403},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40769606828689575},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36595070362091064},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36294054985046387},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.12195822596549988},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1016/s0167-6377(00)00053-5","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0167-6377(00)00053-5","pdf_url":null,"source":{"id":"https://openalex.org/S27769002","display_name":"Operations Research Letters","issn_l":"0167-6377","issn":["0167-6377","1872-7468"],"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":"Operations Research Letters","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/9106381e-3c3e-426d-9678-b896d773aa36","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/9106381e-3c3e-426d-9678-b896d773aa36","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Seiden, S S, Sgall, J & Woeginger, G J 2000, 'Semi-online scheduling with decreasing job sizes', Operations Research Letters, vol. 27, no. 5, pp. 215-221. https://doi.org/10.1016/S0167-6377(00)00053-5","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:645277","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=645277","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0167-6377","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.42.6418","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.6418","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://bit.csc.lsu.edu/~seiden/ordered6.ps.Z","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.55.6659","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.6659","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.cas.cz/~sgall/ps/decr.ps.gz","raw_type":"text"},{"id":"pmh:oai:invenio.nusl.cz:25957","is_oa":false,"landing_page_url":"http://www.nusl.cz/ntk/nusl-25957","pdf_url":null,"source":{"id":"https://openalex.org/S4306402266","display_name":"Digital Repository (National Repository of Grey Literature)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79620101","host_organization_name":"University of Arkansas for Medical Sciences","host_organization_lineage":["https://openalex.org/I79620101"],"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":"info:eu-repo/semantics/report"},{"id":"pmh:oai:library.tue.nl:645277","is_oa":false,"landing_page_url":"http://repository.tue.nl/645277","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0167-6377","raw_type":"Article / Letter to the editor"},{"id":"pmh:tue:oai:pure.tue.nl:publications/9106381e-3c3e-426d-9678-b896d773aa36","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/9106381e-3c3e-426d-9678-b896d773aa36","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Operations Research Letters, 27(5), 215 - 221. Elsevier","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.6499999761581421,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W55614575","https://openalex.org/W1481317444","https://openalex.org/W1571559344","https://openalex.org/W1802738979","https://openalex.org/W1880999269","https://openalex.org/W1965521122","https://openalex.org/W1982084418","https://openalex.org/W1993134505","https://openalex.org/W1996869102","https://openalex.org/W1999476761","https://openalex.org/W2021598206","https://openalex.org/W2024141097","https://openalex.org/W2027131870","https://openalex.org/W2027593932","https://openalex.org/W2065952334","https://openalex.org/W2084524235","https://openalex.org/W2089269509","https://openalex.org/W2104680817","https://openalex.org/W2112475567","https://openalex.org/W3137469021","https://openalex.org/W4210281823","https://openalex.org/W6602326258"],"related_works":["https://openalex.org/W2051209951","https://openalex.org/W2058681277","https://openalex.org/W1493790977","https://openalex.org/W1996806106","https://openalex.org/W2951573806","https://openalex.org/W2090027528","https://openalex.org/W4241266436","https://openalex.org/W2208110155","https://openalex.org/W96431103","https://openalex.org/W2047204419"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}