{"id":"https://openalex.org/W2391399693","doi":null,"title":"Earliness-Tardiness Job Scheduling Problem with a Common Due Window on Non-uniform Machines","display_name":"Earliness-Tardiness Job Scheduling Problem with a Common Due Window on Non-uniform Machines","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2391399693","mag":"2391399693"},"language":"en","primary_location":{"id":"mag:2391399693","doi":null,"is_oa":false,"landing_page_url":"https://en.cnki.com.cn/Article_en/CJFDTOTAL-XTLL200104013.htm","pdf_url":null,"source":{"id":"https://openalex.org/S88664677","display_name":"Systems Engineering - Theory & Practice","issn_l":"1874-8651","issn":["1874-8651"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Systems Engineering - Theory & Practice","raw_type":null},"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/A5109303993","display_name":"Huang De","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Huang De","raw_affiliation_strings":["cai\\+1, ZHU  Yi\\|hua\\+2, WANG Wan\\|liang\\+1"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"cai\\+1, ZHU  Yi\\|hua\\+2, WANG Wan\\|liang\\+1","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5109303993"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"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.9990000128746033,"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.9990000128746033,"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/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.00039999998989515007,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.0,"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/earliness-tardiness-scheduling","display_name":"earliness-tardiness scheduling","score":0.9679999947547913},{"id":"https://openalex.org/keywords/uniform-parallel-machines","display_name":"uniform parallel machines","score":0.8119999766349792},{"id":"https://openalex.org/keywords/makespan-minimization","display_name":"makespan minimization","score":0.8679999709129333},{"id":"https://openalex.org/keywords/np-completeness","display_name":"NP-completeness","score":0.7850000262260437},{"id":"https://openalex.org/keywords/heuristic-algorithms","display_name":"heuristic algorithms","score":0.9779999852180481},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.40799999237060547}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.9165606498718262},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.8304798603057861},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.714059591293335},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.584308922290802},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.4971525967121124},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.48058247566223145},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.46976563334465027},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.4432017207145691},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4303535521030426},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31309255957603455},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.11327788233757019},{"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":[{"id":"mag:2391399693","doi":null,"is_oa":false,"landing_page_url":"https://en.cnki.com.cn/Article_en/CJFDTOTAL-XTLL200104013.htm","pdf_url":null,"source":{"id":"https://openalex.org/S88664677","display_name":"Systems Engineering - Theory & Practice","issn_l":"1874-8651","issn":["1874-8651"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Systems Engineering - Theory & Practice","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2131729411","https://openalex.org/W2103640714","https://openalex.org/W2222720364","https://openalex.org/W2063047053","https://openalex.org/W939502705","https://openalex.org/W2015895026","https://openalex.org/W2169071044","https://openalex.org/W1976380858","https://openalex.org/W2011625792","https://openalex.org/W1991107708"],"abstract_inverted_index":{"A":[0],"mathematical":[1],"model":[2],"for":[3,46],"earliness\\|tardiness":[4],"job":[5,21],"scheduling":[6,22,48],"problem":[7,23,26,49],"with":[8],"a":[9,25,36],"common":[10],"due":[11],"window":[12],"on":[13,33],"non\\|uniform":[14],"machines":[15],"is":[16,31,39,63],"put":[17],"forward.":[18],"Because":[19],"the":[20,47,60],"contains":[24],"of":[27],"minimum":[28],"makespan,":[29],"which":[30],"NP\\|complete":[32],"uniform":[34],"machines,":[35],"heuristic":[37,61],"algorithm":[38,62],"presented":[40],"to":[41],"find":[42],"an":[43,52],"approximate":[44],"solution":[45],"after":[50],"proving":[51],"important":[53],"theorem.":[54],"Two":[55],"numerical":[56],"examples":[57],"illustrate":[58],"that":[59],"very":[64],"effective":[65],"in":[66],"obtaining":[67],"near\\|optimal":[68],"solution.":[69]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2025-10-10T17:16:08.811792","created_date":"2016-06-24T00:00:00"}