{"id":"https://openalex.org/W4230515145","doi":"https://doi.org/10.1137/1.9781611974331.ch11","title":"Make-to-Order Integrated Scheduling and Distribution","display_name":"Make-to-Order Integrated Scheduling and Distribution","publication_year":2015,"publication_date":"2015-12-21","ids":{"openalex":"https://openalex.org/W4230515145","doi":"https://doi.org/10.1137/1.9781611974331.ch11"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611974331.ch11","is_oa":true,"landing_page_url":"https://doi.org/10.1137/1.9781611974331.ch11","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611974331.ch11","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611974331.ch11","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082061504","display_name":"Yossi Azar","orcid":"https://orcid.org/0000-0002-5097-8993"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yossi Azar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057109268","display_name":"Amir Epstein","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Amir Epstein","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007826587","display_name":"\u0141ukasz Je\u017c","orcid":"https://orcid.org/0000-0002-7375-0641"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lukasz Je\u017c","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5046937566","display_name":"Adi Vardi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Adi Vardi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5082061504"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3505,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.72754296,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"140","last_page":"154"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9980000257492065,"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/T11182","display_name":"Auction Theory and Applications","score":0.987500011920929,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6929764747619629},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5985885858535767},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.58615642786026},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5127311944961548},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4656456410884857},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.4226866364479065},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.41448915004730225},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.37087690830230713},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.13226109743118286},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1300407350063324}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6929764747619629},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5985885858535767},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.58615642786026},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5127311944961548},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4656456410884857},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.4226866364479065},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.41448915004730225},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.37087690830230713},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.13226109743118286},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1300407350063324},{"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":1,"locations":[{"id":"doi:10.1137/1.9781611974331.ch11","is_oa":true,"landing_page_url":"https://doi.org/10.1137/1.9781611974331.ch11","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611974331.ch11","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1137/1.9781611974331.ch11","is_oa":true,"landing_page_url":"https://doi.org/10.1137/1.9781611974331.ch11","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611974331.ch11","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320315434","display_name":"Sarepta Therapeutics","ror":"https://ror.org/054f2wp19"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3204654320","https://openalex.org/W2184166483","https://openalex.org/W2397293317","https://openalex.org/W2377713709","https://openalex.org/W2373973180","https://openalex.org/W2372008037","https://openalex.org/W2978148977","https://openalex.org/W3003077338","https://openalex.org/W2225350526","https://openalex.org/W1545991362"],"abstract_inverted_index":{"Production":[0],"and":[1,25,45],"distribution":[2,47,62,65],"are":[3],"fundamental":[4,92],"operational":[5,19],"functions":[6],"in":[7],"supply":[8],"chains.":[9],"The":[10,51],"main":[11],"challenge":[12],"is":[13,53,105],"to":[14,48,54,61,67,106],"design":[15,71],"algorithms":[16,83],"that":[17],"optimize":[18],"performance":[20],"by":[21],"jointly":[22],"scheduling":[23,38,94],"production":[24],"delivery":[26],"of":[27,37,95],"customer":[28,39],"orders.":[29],"In":[30],"this":[31],"paper":[32],"we":[33],"study":[34],"a":[35],"model":[36,89],"orders":[40],"on":[41,97],"multiple":[42,98],"identical":[43,99],"machines":[44,100],"their":[46],"customers":[49],"afterwards.":[50],"goal":[52,103],"minimize":[55,107],"the":[56,68,72,78,102,108,115],"total":[57,64,109],"time":[58],"from":[59],"release":[60],"plus":[63],"cost":[66],"customers.":[69],"We":[70],"first":[73],"poly-logarithmic":[74],"competitive":[75,86],"algorithm":[76],"for":[77],"problem,":[79],"improving":[80],"upon":[81],"previous":[82],"with":[84],"linear":[85],"ratios.":[87],"Our":[88],"generalizes":[90],"two":[91],"problems:":[93],"jobs":[96],"(where":[101],"function":[104],"flow":[110],"time)":[111],"as":[112,114],"well":[113],"TCP":[116],"Acknowledgment":[117],"problem.":[118]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-05-20T08:49:12.498775","created_date":"2025-10-10T00:00:00"}