{"id":"https://openalex.org/W49124236","doi":null,"title":"A Model for Make-To-Order Revenue Management 1","display_name":"A Model for Make-To-Order Revenue Management 1","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W49124236","mag":"49124236"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.86.7058","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.7058","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.mit.edu/jgallien/www/mtorevenuemanagement.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5006927731","display_name":"J\u00e9r\u00e9mie Gallien","orcid":"https://orcid.org/0000-0001-6292-5031","observed_orcids":["https://orcid.org/0000-0001-6292-5031"]},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J\u00e9r\u00e9mie Gallien","raw_affiliation_strings":["Massachusetts Institute of Technology"],"raw_orcid":"https://orcid.org/0000-0001-6292-5031","affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071037826","display_name":"Yann Le Tallec","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yann Le Tallec","raw_affiliation_strings":["Massachusetts Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074435128","display_name":"Tor Schoenmeyr","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tor Schoenmeyr","raw_affiliation_strings":["Massachusetts Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":1.0141,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.77673038,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":96},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.8496000170707703,"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"}},"topics":[{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.8496000170707703,"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"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.09860000014305115,"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/T10328","display_name":"Supply Chain and Inventory Management","score":0.038100000470876694,"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/dynamic-admission-control","display_name":"dynamic admission control","score":0.75},{"id":"https://openalex.org/keywords/single-machine-scheduling","display_name":"single machine scheduling","score":0.7570000290870667},{"id":"https://openalex.org/keywords/preemptive-scheduling","display_name":"preemptive scheduling","score":0.8989999890327454},{"id":"https://openalex.org/keywords/hard-deadlines","display_name":"hard deadlines","score":0.7599999904632568},{"id":"https://openalex.org/keywords/opportunity-cost","display_name":"opportunity cost","score":0.6179999709129333},{"id":"https://openalex.org/keywords/contract-negotiation","display_name":"contract negotiation","score":0.6159999966621399},{"id":"https://openalex.org/keywords/lead-time","display_name":"lead time","score":0.3479999899864197},{"id":"https://openalex.org/keywords/discrete-time-formulation","display_name":"discrete-time formulation","score":0.5080000162124634}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7325568795204163},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7238765358924866},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6431773900985718},{"id":"https://openalex.org/C2781386248","wikidata":"https://www.wikidata.org/wiki/Q11898700","display_name":"Revenue management","level":3,"score":0.6183986067771912},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.614295244216919},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.58663409948349},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5026168823242188},{"id":"https://openalex.org/C181622380","wikidata":"https://www.wikidata.org/wiki/Q26911","display_name":"Profit (economics)","level":2,"score":0.4666576087474823},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.447967529296875},{"id":"https://openalex.org/C177774035","wikidata":"https://www.wikidata.org/wiki/Q1246948","display_name":"Granularity","level":2,"score":0.43787819147109985},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.43593692779541016},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.4352197051048279},{"id":"https://openalex.org/C195487862","wikidata":"https://www.wikidata.org/wiki/Q850210","display_name":"Revenue","level":2,"score":0.43262699246406555},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.41717270016670227},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4153582453727722},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.16212284564971924},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.15051555633544922},{"id":"https://openalex.org/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","level":1,"score":0.13766589760780334},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13068458437919617},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C121955636","wikidata":"https://www.wikidata.org/wiki/Q4116214","display_name":"Accounting","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.86.7058","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.7058","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.mit.edu/jgallien/www/mtorevenuemanagement.pdf","raw_type":"text"},{"id":"mag:49124236","doi":null,"is_oa":false,"landing_page_url":"http://web.mit.edu/jgallien/www/mtorevenuemanagement.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W74203006","https://openalex.org/W194244820","https://openalex.org/W1576452626","https://openalex.org/W1591372412","https://openalex.org/W1879402272","https://openalex.org/W1971960804","https://openalex.org/W2020471037","https://openalex.org/W2020677283","https://openalex.org/W2023171863","https://openalex.org/W2078234942","https://openalex.org/W2081954069","https://openalex.org/W2098432798","https://openalex.org/W2105628511","https://openalex.org/W3122202669","https://openalex.org/W3123517799"],"related_works":["https://openalex.org/W1973880740","https://openalex.org/W2361192029","https://openalex.org/W2277767281","https://openalex.org/W2919671518","https://openalex.org/W6989574053","https://openalex.org/W2120902797","https://openalex.org/W1964092764","https://openalex.org/W3086488455","https://openalex.org/W4411687316","https://openalex.org/W2575807534"],"abstract_inverted_index":{"Seeking":[0],"to":[1,57,86,150,156,183],"help":[2],"practitioners":[3],"establish":[4,46,73],"quantitative":[5],"guidelines":[6],"for":[7,64,98,167],"negotiating":[8],"make-to-order":[9],"contracts":[10],"along":[11],"the":[12,21,39,65,80,99,131],"dimensions":[13],"of":[14,25,41,67,79,102],"price,":[15],"quantity":[16],"and":[17,59,76,92,112,177,186],"lead-time,":[18],"we":[19,45,84],"investigate":[20],"dynamic":[22,143],"admission":[23],"control":[24],"jobs":[26],"with":[27,35,188],"hard":[28],"deadlines":[29],"into":[30],"a":[31,61,77,104,172],"single":[32],"machine":[33],"queue":[34],"preemptive":[36],"scheduling.":[37],"Using":[38],"concept":[40],"minimum":[42],"workload":[43],"function,":[44],"that":[47,116,130,146],"earliest":[48],"due-date":[49],"scheduling":[50],"can":[51],"be":[52],"assumed":[53],"at":[54,171],"no":[55],"cost":[56,101],"optimality,":[58],"propose":[60],"discrete-time":[62],"formulation":[63],"problem":[66],"maximizing":[68],"long-run":[69],"expected":[70],"profit.":[71],"We":[72],"some":[74],"properties":[75],"characterization":[78],"optimal":[81,132],"policy,":[82],"which":[83],"exploit":[85],"derive":[87,157],"two":[88,142],"heuristic":[89,164],"policies":[90],"(fluid":[91],"lookahead)":[93],"relying":[94],"on":[95],"different":[96],"approximations":[97],"opportunity":[100],"accepting":[103],"job.":[105],"Numerical":[106],"experiments":[107,127],"under":[108],"various":[109],"load,":[110],"stretch":[111],"granularity":[113],"parameters":[114],"suggest":[115,129],"they":[117],"always":[118],"perform":[119,136],"better":[120],"than":[121],"common":[122],"simple":[123,149],"static":[124,133],"policies.":[125],"Limited":[126],"also":[128],"policy":[134,147],"may":[135],"nearly":[137],"as":[138,140],"well":[139],"our":[141,162],"heuristics.":[144],"While":[145],"is":[148],"implement":[151],"however,":[152],"it":[153],"seems":[154],"challenging":[155],"using":[158],"known":[159],"methods.":[160],"Overall,":[161],"fluid":[163],"stands":[165],"out":[166],"its":[168,178],"robust":[169],"performance":[170],"relatively":[173],"low":[174],"computational":[175],"cost,":[176],"possible":[179],"extensions":[180],"in":[181],"practice":[182],"non-stationary":[184],"demand":[185],"orders":[187],"staggered":[189],"deliveries.":[190],"1.":[191]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-03T10:50:19.383937","created_date":"2016-06-24T00:00:00"}