{"id":"https://openalex.org/W7145220186","doi":null,"title":"Dynamic Programming Algorithms for Lot-Sizing Problems","display_name":"Dynamic Programming Algorithms for Lot-Sizing Problems","publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W7145220186"},"language":"ja","primary_location":{"id":"pmh:oai:irdb.nii.ac.jp:01429:0002641368","doi":null,"is_oa":true,"landing_page_url":"https://edo.repo.nii.ac.jp/records/65","pdf_url":null,"source":{"id":"https://openalex.org/S7407056385","display_name":"Institutional Repositories DataBase (IRDB)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I184597095","host_organization_name":"National Institute of Informatics","host_organization_lineage":["https://openalex.org/I184597095"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"departmental bulletin paper"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://edo.repo.nii.ac.jp/records/65","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005328450","display_name":"\u30b6\u30f3 \u30d4\u30f3","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"\u30b6\u30f3, \u30d4\u30f3","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5075473282","display_name":"Ping Zhan","orcid":"https://orcid.org/0000-0002-1183-1550","observed_orcids":["https://orcid.org/0000-0002-1183-1550"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhan, Ping","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.8012999892234802,"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.8012999892234802,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.07339999824762344,"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/T10328","display_name":"Supply Chain and Inventory Management","score":0.06840000301599503,"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/lot-sizing","display_name":"lot sizing","score":0.9610000252723694},{"id":"https://openalex.org/keywords/dynamic-programming-algorithm","display_name":"dynamic programming algorithm","score":0.9679999947547913},{"id":"https://openalex.org/keywords/production-planning","display_name":"production planning","score":0.8140000104904175},{"id":"https://openalex.org/keywords/inventory-management","display_name":"inventory management","score":0.5699999928474426},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"algorithm design","score":0.8119999766349792}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6779999732971191},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5974000096321106},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5202000141143799},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.42669999599456787},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3659999966621399},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3433000147342682},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.3303999900817871},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3197000026702881},{"id":"https://openalex.org/C150762246","wikidata":"https://www.wikidata.org/wiki/Q4354073","display_name":"Reactive programming","level":4,"score":0.301800012588501},{"id":"https://openalex.org/C119263510","wikidata":"https://www.wikidata.org/wiki/Q7248501","display_name":"Programming domain","level":4,"score":0.3001999855041504},{"id":"https://openalex.org/C60810621","wikidata":"https://www.wikidata.org/wiki/Q2333568","display_name":"Optimal substructure","level":3,"score":0.28700000047683716},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.27079999446868896},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.26019999384880066}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:irdb.nii.ac.jp:01429:0002641368","doi":null,"is_oa":true,"landing_page_url":"https://edo.repo.nii.ac.jp/records/65","pdf_url":null,"source":{"id":"https://openalex.org/S7407056385","display_name":"Institutional Repositories DataBase (IRDB)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I184597095","host_organization_name":"National Institute of Informatics","host_organization_lineage":["https://openalex.org/I184597095"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"departmental bulletin paper"}],"best_oa_location":{"id":"pmh:oai:irdb.nii.ac.jp:01429:0002641368","doi":null,"is_oa":true,"landing_page_url":"https://edo.repo.nii.ac.jp/records/65","pdf_url":null,"source":{"id":"https://openalex.org/S7407056385","display_name":"Institutional Repositories DataBase (IRDB)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I184597095","host_organization_name":"National Institute of Informatics","host_organization_lineage":["https://openalex.org/I184597095"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"departmental bulletin paper"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2106263545","https://openalex.org/W7135625781","https://openalex.org/W2337806264","https://openalex.org/W2613241661","https://openalex.org/W3110748997","https://openalex.org/W2163172555","https://openalex.org/W2523604400","https://openalex.org/W623012475","https://openalex.org/W2908960084","https://openalex.org/W7062850268"],"abstract_inverted_index":{"Lot-sizing":[0],"problem":[1],"has":[2],"been":[3],"extensively":[4],"researched":[5],"in":[6,20],"many":[7],"aspects.":[8],"In":[9],"this":[10],"review,":[11],"we":[12],"summarize":[13],"key":[14],"points":[15],"of":[16,34],"dynamic":[17],"programming":[18],"algorithms":[19,30],"lot-sizing":[21,35],"problems":[22,36],"and":[23],"give":[24],"some":[25],"hints":[26],"helping":[27],"further":[28],"designing":[29],"for":[31],"more":[32],"variations":[33],"([4]).":[37]},"counts_by_year":[],"updated_date":"2026-10-12T09:40:04.860316","created_date":"2026-04-01T00:00:00"}