{"id":"https://openalex.org/W2137215422","doi":"https://doi.org/10.1007/s10107-006-0013-4","title":"On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems","display_name":"On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems","publication_year":2006,"publication_date":"2006-07-13","ids":{"openalex":"https://openalex.org/W2137215422","doi":"https://doi.org/10.1007/s10107-006-0013-4","mag":"2137215422"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-006-0013-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-006-0013-4","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","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/A5091291585","display_name":"Yunpeng Pan","orcid":"https://orcid.org/0000-0002-3373-0769"},"institutions":[{"id":"https://openalex.org/I906832008","display_name":"Endocyte (United States)","ror":"https://ror.org/058dk4619","country_code":"US","type":"company","lineage":["https://openalex.org/I906832008"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yunpeng Pan","raw_affiliation_strings":["TomoTherapy Inc., 1240 Deming Way, Madison, WI, 53717-1954, USA","TomoTherapy Inc., 1240 Deming Way, 53717-1954, Madison, WI, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TomoTherapy Inc., 1240 Deming Way, Madison, WI, 53717-1954, USA","institution_ids":["https://openalex.org/I906832008"]},{"raw_affiliation_string":"TomoTherapy Inc., 1240 Deming Way, 53717-1954, Madison, WI, USA#TAB#","institution_ids":["https://openalex.org/I906832008"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101529205","display_name":"Leyuan Shi","orcid":"https://orcid.org/0000-0002-1397-2891"},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Leyuan Shi","raw_affiliation_strings":["ISyE Department, University of Wisconsin-Madison, Madison, WI, 53706, USA","University of Wisconsin-Madison, ISyE Department, 1240 Deming Way, 53706, Madison, WI, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ISyE Department, University of Wisconsin-Madison, Madison, WI, 53706, USA","institution_ids":["https://openalex.org/I135310074"]},{"raw_affiliation_string":"University of Wisconsin-Madison, ISyE Department, 1240 Deming Way, 53706, Madison, WI, USA#TAB#","institution_ids":["https://openalex.org/I135310074"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":5.7397,"has_fulltext":false,"cited_by_count":41,"citation_normalized_percentile":{"value":0.95512058,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"110","issue":"3","first_page":"543","last_page":"559"},"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9955999851226807,"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.9914000034332275,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.8179365992546082},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6813920736312866},{"id":"https://openalex.org/keywords/tardiness","display_name":"Tardiness","score":0.662189781665802},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6149270534515381},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.599262535572052},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5403715372085571},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5122891664505005},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.5056779384613037},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5048073530197144},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.49606284499168396},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45948657393455505},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.384620726108551},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.36631786823272705},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2982174754142761},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24452874064445496},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.08505761623382568},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07799836993217468}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.8179365992546082},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6813920736312866},{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.662189781665802},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6149270534515381},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.599262535572052},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5403715372085571},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5122891664505005},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.5056779384613037},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5048073530197144},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.49606284499168396},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45948657393455505},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.384620726108551},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.36631786823272705},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2982174754142761},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24452874064445496},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.08505761623382568},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07799836993217468},{"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/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10107-006-0013-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-006-0013-4","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W27038116","https://openalex.org/W1529681250","https://openalex.org/W1968143987","https://openalex.org/W1992382037","https://openalex.org/W2005900475","https://openalex.org/W2039823842","https://openalex.org/W2047571228","https://openalex.org/W2056466128","https://openalex.org/W2056851674","https://openalex.org/W2060552317","https://openalex.org/W2071306171","https://openalex.org/W2081798943","https://openalex.org/W2111244700","https://openalex.org/W2113856408","https://openalex.org/W2140333448","https://openalex.org/W2157530413","https://openalex.org/W2159152246","https://openalex.org/W2164483807","https://openalex.org/W2222310003","https://openalex.org/W2505968561","https://openalex.org/W2618247029","https://openalex.org/W4234873221","https://openalex.org/W4253741566"],"related_works":["https://openalex.org/W3097192092","https://openalex.org/W3029619930","https://openalex.org/W2061005265","https://openalex.org/W4252122881","https://openalex.org/W2084616826","https://openalex.org/W134055995","https://openalex.org/W2024604250","https://openalex.org/W2002220688","https://openalex.org/W2243328125","https://openalex.org/W2009796757"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}