{"id":"https://openalex.org/W2298323795","doi":"https://doi.org/10.1007/s11424-016-4187-4","title":"Scheduling problems with rejection to minimize the maximum flow time","display_name":"Scheduling problems with rejection to minimize the maximum flow time","publication_year":2016,"publication_date":"2016-03-18","ids":{"openalex":"https://openalex.org/W2298323795","doi":"https://doi.org/10.1007/s11424-016-4187-4","mag":"2298323795"},"language":"en","primary_location":{"id":"doi:10.1007/s11424-016-4187-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11424-016-4187-4","pdf_url":null,"source":{"id":"https://openalex.org/S45848134","display_name":"Journal of Systems Science and Complexity","issn_l":"1009-6124","issn":["1009-6124","1559-7067"],"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":"Journal of Systems Science and Complexity","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/A5085082654","display_name":"Liqi Zhang","orcid":"https://orcid.org/0000-0002-6421-680X"},"institutions":[{"id":"https://openalex.org/I4750791","display_name":"Henan Agricultural University","ror":"https://ror.org/04eq83d71","country_code":"CN","type":"education","lineage":["https://openalex.org/I4750791"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Liqi Zhang","raw_affiliation_strings":["College of Information and Management Science, Henan Agricultural University, Zhengzhou, 450003, China"],"affiliations":[{"raw_affiliation_string":"College of Information and Management Science, Henan Agricultural University, Zhengzhou, 450003, China","institution_ids":["https://openalex.org/I4750791"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081699183","display_name":"Lingfa Lu","orcid":"https://orcid.org/0000-0002-2561-5613"},"institutions":[{"id":"https://openalex.org/I38877650","display_name":"Zhengzhou University","ror":"https://ror.org/04ypx8c21","country_code":"CN","type":"education","lineage":["https://openalex.org/I38877650"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Lingfa Lu","raw_affiliation_strings":["School of Mathematics and Statistics, Zhengzhou University, Zhengzhou, 450001, China"],"affiliations":[{"raw_affiliation_string":"School of Mathematics and Statistics, Zhengzhou University, Zhengzhou, 450001, China","institution_ids":["https://openalex.org/I38877650"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5081699183"],"corresponding_institution_ids":["https://openalex.org/I38877650"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.01511585,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"29","issue":"5","first_page":"1293","last_page":"1301"},"is_retracted":false,"is_paratext":false,"is_xpac":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/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9944999814033508,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7087982892990112},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.6143637299537659},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.5789754986763},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5687940716743469},{"id":"https://openalex.org/keywords/complex-system","display_name":"Complex system","score":0.5295582413673401},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5250247120857239},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4689492881298065},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4625263810157776},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4419928789138794},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.41258400678634644},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.36308830976486206},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35209888219833374},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20107057690620422},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.10811266303062439},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10425618290901184}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7087982892990112},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.6143637299537659},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.5789754986763},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5687940716743469},{"id":"https://openalex.org/C47822265","wikidata":"https://www.wikidata.org/wiki/Q854457","display_name":"Complex system","level":2,"score":0.5295582413673401},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5250247120857239},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4689492881298065},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4625263810157776},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4419928789138794},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.41258400678634644},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.36308830976486206},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35209888219833374},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20107057690620422},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.10811266303062439},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10425618290901184},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s11424-016-4187-4","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11424-016-4187-4","pdf_url":null,"source":{"id":"https://openalex.org/S45848134","display_name":"Journal of Systems Science and Complexity","issn_l":"1009-6124","issn":["1009-6124","1559-7067"],"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":"Journal of Systems Science and Complexity","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1543365144","https://openalex.org/W1599968085","https://openalex.org/W1986546680","https://openalex.org/W1988565742","https://openalex.org/W1988943741","https://openalex.org/W1996096689","https://openalex.org/W2012228660","https://openalex.org/W2013892022","https://openalex.org/W2027500583","https://openalex.org/W2069639016","https://openalex.org/W2085716075","https://openalex.org/W2095264582","https://openalex.org/W2107911578","https://openalex.org/W2561675875","https://openalex.org/W3165743976","https://openalex.org/W4234569973","https://openalex.org/W4241977206","https://openalex.org/W4248841288","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2012754152","https://openalex.org/W2152153864","https://openalex.org/W2384952691","https://openalex.org/W2949165180","https://openalex.org/W4389633695","https://openalex.org/W2838819579","https://openalex.org/W131757205","https://openalex.org/W2884927689","https://openalex.org/W2538210412","https://openalex.org/W1968714144"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}