{"id":"https://openalex.org/W2046797669","doi":"https://doi.org/10.1016/0167-6377(92)90060-g","title":"A new lower bound approach for single-machine multicriteria scheduling","display_name":"A new lower bound approach for single-machine multicriteria scheduling","publication_year":1992,"publication_date":"1992-02-01","ids":{"openalex":"https://openalex.org/W2046797669","doi":"https://doi.org/10.1016/0167-6377(92)90060-g","mag":"2046797669"},"language":"en","primary_location":{"id":"doi:10.1016/0167-6377(92)90060-g","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0167-6377(92)90060-g","pdf_url":"https://www.sciencedirect.com/science/article/pii/016763779290060G","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":true,"oa_status":"bronze","oa_url":"https://www.sciencedirect.com/science/article/pii/016763779290060G","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007204231","display_name":"J.A. Hoogeveen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J.A Hoogeveen","raw_affiliation_strings":["Centre for Mathematics and Computer Science, P.O. Box 4079, 1009 AB Amsterdam, The Netherlands","Centre for Mathematics and Computer Science, P.O. Box 4079, 1009 AB Amsterdam, The Netherlands#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centre for Mathematics and Computer Science, P.O. Box 4079, 1009 AB Amsterdam, The Netherlands","institution_ids":[]},{"raw_affiliation_string":"Centre for Mathematics and Computer Science, P.O. Box 4079, 1009 AB Amsterdam, The Netherlands#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009663049","display_name":"Steef van de Velde","orcid":"https://orcid.org/0009-0001-3549-8684"},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"S.L van de Velde","raw_affiliation_strings":["School of Management Studies, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands","School of Management Studies, University of Twente P.O. Box 217, 7500 AE Enschede, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Management Studies, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands","institution_ids":["https://openalex.org/I94624287"]},{"raw_affiliation_string":"School of Management Studies, University of Twente P.O. Box 217, 7500 AE Enschede, The Netherlands","institution_ids":["https://openalex.org/I94624287"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2760,"currency":"USD","value_usd":2760},"apc_paid":null,"fwci":1.0113,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.78477078,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"11","issue":"1","first_page":"39","last_page":"44"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9979000091552734,"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.9872000217437744,"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/computation","display_name":"Computation","score":0.7480666637420654},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7193740010261536},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6532122492790222},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5802718997001648},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5748288035392761},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"Single-machine scheduling","score":0.5723549127578735},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4282803535461426},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4128761887550354},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.3318002223968506},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3258816599845886}],"concepts":[{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.7480666637420654},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7193740010261536},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6532122492790222},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5802718997001648},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5748288035392761},{"id":"https://openalex.org/C2780271269","wikidata":"https://www.wikidata.org/wiki/Q19295956","display_name":"Single-machine scheduling","level":4,"score":0.5723549127578735},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4282803535461426},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4128761887550354},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.3318002223968506},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3258816599845886},{"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},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1016/0167-6377(92)90060-g","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0167-6377(92)90060-g","pdf_url":"https://www.sciencedirect.com/science/article/pii/016763779290060G","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:ris.utwente.nl:publications/99d27fed-b495-42d0-8e17-46f3182f6535","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/99d27fed-b495-42d0-8e17-46f3182f6535","pdf_url":"https://ris.utwente.nl/ws/files/7044121/Velde92new.pdf","source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Hoogeveen, J A & van de Velde, S L 1992, 'A new lower bound approach for single-machine multicriteria scheduling', Operations research letters, vol. 0, no. 11, pp. 39-44. https://doi.org/10.1016/0167-6377(92)90060-G","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:eur:oai:repub.eur.nl:12355","is_oa":true,"landing_page_url":"http://hdl.handle.net/1765/12355","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":"Operations Research Letters, 39 - 44","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:repub.eur.nl:12355","is_oa":true,"landing_page_url":"http://repub.eur.nl/pub/12355","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":"Operations Research Letters, pp. 39-44","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1016/0167-6377(92)90060-g","is_oa":true,"landing_page_url":"https://doi.org/10.1016/0167-6377(92)90060-g","pdf_url":"https://www.sciencedirect.com/science/article/pii/016763779290060G","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"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.6700000166893005,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2046797669.pdf","grobid_xml":"https://content.openalex.org/works/W2046797669.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W63866131","https://openalex.org/W1488422606","https://openalex.org/W1965167205","https://openalex.org/W1976006166","https://openalex.org/W1988328380","https://openalex.org/W2038781246","https://openalex.org/W2042355643","https://openalex.org/W2122499457","https://openalex.org/W2123948245","https://openalex.org/W2259492858","https://openalex.org/W3044911583","https://openalex.org/W6602630727","https://openalex.org/W6780752570"],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W2107725657","https://openalex.org/W2112121444","https://openalex.org/W2509452605","https://openalex.org/W3204654320","https://openalex.org/W1974309933","https://openalex.org/W2092240563","https://openalex.org/W2094800167","https://openalex.org/W2898780166","https://openalex.org/W1993477581"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-06-22T06:23:43.705686","created_date":"2025-10-10T00:00:00"}