乐胖代购免代理版

{"id":"https://openalex.org/W2161227823","doi":"https://doi.org/10.1142/s0217595909002432","title":"TWO-MACHINE FLOW-SHOP MINIMUM-LENGTH SCHEDULING WITH INTERVAL PROCESSING TIMES","display_name":"TWO-MACHINE FLOW-SHOP MINIMUM-LENGTH SCHEDULING WITH INTERVAL PROCESSING TIMES","publication_year":2009,"publication_date":"2009-12-01","ids":{"openalex":"https://openalex.org/W2161227823","doi":"https://doi.org/10.1142/s0217595909002432","mag":"2161227823"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0217595909002432","pdf_url":null,"source":{"id":"https://openalex.org/S1254427","display_name":"Asia Pacific Journal of Operational Research","issn_l":"0217-5959","issn":["0217-5959","1793-7019"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5055363976","display_name":"C.T. Ng","orcid":"https://orcid.org/0000-0003-0020-8234"},"institutions":[{"id":"https://openalex.org/I14243506","display_name":"Hong Kong Polytechnic University","ror":"https://ror.org/0030zas98","country_code":"HK","type":"education","lineage":["https://openalex.org/I14243506"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"C. T. NG","raw_affiliation_strings":["Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong"],"affiliations":[{"raw_affiliation_string":"Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong","institution_ids":["https://openalex.org/I14243506"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058437763","display_name":"Natalja M. Matsveichuk","orcid":null},"institutions":[{"id":"https://openalex.org/I151823869","display_name":"National Academy of Sciences of Belarus","ror":"https://ror.org/02j8pe645","country_code":"BY","type":"government","lineage":["https://openalex.org/I151823869"]},{"id":"https://openalex.org/I4210105192","display_name":"United Institute of Informatics Problems","ror":"https://ror.org/01ccbsb07","country_code":"BY","type":"facility","lineage":["https://openalex.org/I151823869","https://openalex.org/I4210105192","https://openalex.org/I4210116091"]}],"countries":["BY"],"is_corresponding":false,"raw_author_name":"NATALJA M. MATSVEICHUK","raw_affiliation_strings":["United Institute of Informatics Problems, National Academy of Sciences of Belarus, Surganova Street, 6, Minsk 220012, Belarus"],"affiliations":[{"raw_affiliation_string":"United Institute of Informatics Problems, National Academy of Sciences of Belarus, Surganova Street, 6, Minsk 220012, Belarus","institution_ids":["https://openalex.org/I151823869","https://openalex.org/I4210105192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062123009","display_name":"Yuri N. Sotskov","orcid":"https://orcid.org/0000-0002-9971-6169"},"institutions":[{"id":"https://openalex.org/I151823869","display_name":"National Academy of Sciences of Belarus","ror":"https://ror.org/02j8pe645","country_code":"BY","type":"government","lineage":["https://openalex.org/I151823869"]},{"id":"https://openalex.org/I4210105192","display_name":"United Institute of Informatics Problems","ror":"https://ror.org/01ccbsb07","country_code":"BY","type":"facility","lineage":["https://openalex.org/I151823869","https://openalex.org/I4210105192","https://openalex.org/I4210116091"]}],"countries":["BY"],"is_corresponding":true,"raw_author_name":"YURI N. SOTSKOV","raw_affiliation_strings":["United Institute of Informatics Problems, National Academy of Sciences of Belarus, Surganova Street, 6, Minsk 220012, Belarus"],"affiliations":[{"raw_affiliation_string":"United Institute of Informatics Problems, National Academy of Sciences of Belarus, Surganova Street, 6, Minsk 220012, Belarus","institution_ids":["https://openalex.org/I151823869","https://openalex.org/I4210105192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032676950","display_name":"T.C.E. Cheng","orcid":"https://orcid.org/0000-0001-5127-6419"},"institutions":[{"id":"https://openalex.org/I14243506","display_name":"Hong Kong Polytechnic University","ror":"https://ror.org/0030zas98","country_code":"HK","type":"education","lineage":["https://openalex.org/I14243506"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"T. C. EDWIN CHENG","raw_affiliation_strings":["Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong"],"affiliations":[{"raw_affiliation_string":"Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong","institution_ids":["https://openalex.org/I14243506"]}]}],"institution_assertions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5062123009"],"corresponding_institution_ids":["https://openalex.org/I151823869","https://openalex.org/I4210105192"],"apc_list":null,"apc_paid":null,"fwci":3.778,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":21,"citation_normalized_percentile":{"value":0.939943,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":90},"biblio":{"volume":"26","issue":"06","first_page":"715","last_page":"734"},"is_retracted":false,"is_paratext":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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9935,"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.9916,"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/due-date","display_name":"Due date","score":0.44232526}],"concepts":[{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6703994},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.6443099},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.59537053},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5506451},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5275706},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.51595646},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.46332687},{"id":"https://openalex.org/C3019208289","wikidata":"https://www.wikidata.org/wiki/Q56612115","display_name":"Due date","level":3,"score":0.44232526},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4040102},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0217595909002432","pdf_url":null,"source":{"id":"https://openalex.org/S1254427","display_name":"Asia Pacific Journal of Operational Research","issn_l":"0217-5959","issn":["0217-5959","1793-7019"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.47}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":17,"referenced_works":["https://openalex.org/W1966592923","https://openalex.org/W1977108750","https://openalex.org/W1981918980","https://openalex.org/W1984335678","https://openalex.org/W2008958187","https://openalex.org/W2009261393","https://openalex.org/W2024085737","https://openalex.org/W2030577492","https://openalex.org/W2066167010","https://openalex.org/W2078711278","https://openalex.org/W2090388220","https://openalex.org/W2100147010","https://openalex.org/W2122967269","https://openalex.org/W2154429979","https://openalex.org/W2309325362","https://openalex.org/W4253347690","https://openalex.org/W592790706"],"related_works":["https://openalex.org/W3155166764","https://openalex.org/W2967782293","https://openalex.org/W2955323683","https://openalex.org/W26892725","https://openalex.org/W2559484340","https://openalex.org/W2185192838","https://openalex.org/W2140584489","https://openalex.org/W2069961172","https://openalex.org/W1971939018","https://openalex.org/W1564838499"],"abstract_inverted_index":{"The":[0,101],"flow-shop":[1],"minimum-length":[2],"scheduling":[3],"problem":[4],"with":[5],"n":[6],"jobs":[7,93],"processed":[8],"on":[9],"two":[10,92],"machines":[11],"is":[12,85],"addressed":[13],"where":[14,123],"processing":[15,27,59],"times":[16,28,60],"are":[17,29,37,72,106],"uncertain:":[18],"only":[19],"lower":[20],"and":[21,61,77,103],"upper":[22],"bounds":[23],"of":[24,57,69,91,98,141],"the":[25,58,81,89,109,116,121,132],"random":[26],"given":[30],"before":[31],"scheduling,":[32],"but":[33],"their":[34],"probability":[35],"distributions":[36],"unknown.":[38],"For":[39],"such":[40],"a":[41,47,66,95],"problem,":[42],"there":[43,124],"may":[44,135],"not":[45,126],"exist":[46,127],"dominant":[48,99],"schedule":[49,113,129],"that":[50,71],"remains":[51],"optimal":[52],"for":[53,65,80,108],"all":[54,115],"possible":[55,86],"realizations":[56],"so":[62],"we":[63],"look":[64],"minimal":[67,96],"set":[68,97],"schedules":[70],"dominant.":[73],"We":[74,118],"obtain":[75],"necessary":[76,102],"sufficient":[78,104],"conditions":[79,105,133],"case":[82,110,122],"when":[83,111],"it":[84],"to":[87],"fix":[88],"order":[90],"in":[94,138],"schedules.":[100],"proven":[107,134],"one":[112],"dominates":[114],"others.":[117],"characterize":[119],"also":[120],"does":[125],"non-trivial":[128],"domination.":[130],"All":[131],"be":[136],"tested":[137],"polynomial":[139],"time":[140],"n.":[142]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2161227823","counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2024-12-17T10:22:34.814162","created_date":"2016-06-24"}