{"id":"https://openalex.org/W2018602657","doi":"https://doi.org/10.1142/s0217595908001778","title":"SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES","display_name":"SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES","publication_year":2008,"publication_date":"2008-06-01","ids":{"openalex":"https://openalex.org/W2018602657","doi":"https://doi.org/10.1142/s0217595908001778","mag":"2018602657"},"language":"en","primary_location":{"id":"doi:10.1142/s0217595908001778","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0217595908001778","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Asia-Pacific Journal of Operational Research","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/A5083360976","display_name":"Jinjiang Yuan","orcid":"https://orcid.org/0000-0002-9814-615X"},"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":"JINJIANG YUAN","raw_affiliation_strings":["Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, China"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Zhengzhou University, Zhengzhou, Henan 450052, China","institution_ids":["https://openalex.org/I38877650"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039315882","display_name":"Lei Shi","orcid":"https://orcid.org/0000-0003-3079-9944"},"institutions":[{"id":"https://openalex.org/I4210117382","display_name":"Anyang Normal University","ror":"https://ror.org/02g9nss57","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210117382"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"LEI SHI","raw_affiliation_strings":["Department of Mathematics, Anyang Normal University, Anyang, Henan 455000, China"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Anyang Normal University, Anyang, Henan 455000, China","institution_ids":["https://openalex.org/I4210117382"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085721115","display_name":"Jinwen Ou","orcid":"https://orcid.org/0000-0002-7419-3808"},"institutions":[{"id":"https://openalex.org/I159948400","display_name":"Jinan University","ror":"https://ror.org/02xe5ns62","country_code":"CN","type":"education","lineage":["https://openalex.org/I159948400"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"JINWEN OU","raw_affiliation_strings":["Department of Administrative Management, Jinan University, Guangzhou, Guangdong 510632, China"],"affiliations":[{"raw_affiliation_string":"Department of Administrative Management, Jinan University, Guangzhou, Guangdong 510632, China","institution_ids":["https://openalex.org/I159948400"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5083360976"],"corresponding_institution_ids":["https://openalex.org/I38877650"],"apc_list":null,"apc_paid":null,"fwci":0.8249,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.76705849,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"25","issue":"03","first_page":"317","last_page":"325"},"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.9969000220298767,"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.9901999831199646,"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/time-complexity","display_name":"Time complexity","score":0.6571784019470215},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6393836736679077},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.6160133481025696},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5415317416191101},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5070505142211914},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.43548089265823364},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4256057143211365},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.41974109411239624},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40034911036491394},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3804967999458313},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3693832755088806},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35049715638160706},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.30006393790245056},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07531961798667908}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6571784019470215},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6393836736679077},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.6160133481025696},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5415317416191101},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5070505142211914},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.43548089265823364},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4256057143211365},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.41974109411239624},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40034911036491394},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3804967999458313},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3693832755088806},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35049715638160706},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30006393790245056},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07531961798667908},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"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":"doi:10.1142/s0217595908001778","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0217595908001778","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Asia-Pacific Journal of Operational Research","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:wsi:apjorx:v:25:y:2008:i:03:n:s0217595908001778","is_oa":false,"landing_page_url":"http://www.worldscientific.com/doi/abs/10.1142/S0217595908001778","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6499999761581421,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W964861289","https://openalex.org/W1484610295","https://openalex.org/W1488422606","https://openalex.org/W1964600358","https://openalex.org/W1980015951","https://openalex.org/W1981992833","https://openalex.org/W1994566591","https://openalex.org/W1995313677","https://openalex.org/W2001867530","https://openalex.org/W2011039300","https://openalex.org/W2015718430","https://openalex.org/W2021910476","https://openalex.org/W2026489998","https://openalex.org/W2036301822","https://openalex.org/W2045895304","https://openalex.org/W2060059143","https://openalex.org/W2074395045","https://openalex.org/W2090799175","https://openalex.org/W2093961153","https://openalex.org/W2130568083","https://openalex.org/W2163085705","https://openalex.org/W2186333639","https://openalex.org/W2341350247","https://openalex.org/W2576116471","https://openalex.org/W3044911583","https://openalex.org/W4244592547","https://openalex.org/W4254292280"],"related_works":["https://openalex.org/W2368250618","https://openalex.org/W2810352541","https://openalex.org/W2040050870","https://openalex.org/W2970302286","https://openalex.org/W3089811425","https://openalex.org/W2142195909","https://openalex.org/W2801279942","https://openalex.org/W1815446007","https://openalex.org/W2962917430","https://openalex.org/W1903284337"],"abstract_inverted_index":{"We":[0,102],"consider":[1],"a":[2,16,21,69,79,90,105,115],"non-preemptive":[3],"single":[4,116],"machine":[5],"scheduling":[6],"problem":[7,54],"with":[8,12,68,89,98,114],"forbidden":[9,73,100,117],"intervals.":[10,101],"Associated":[11],"each":[13],"job":[14,32],"is":[15,33,37,55],"given":[17],"processing":[18,29],"time":[19,23,41,81,86,107],"and":[20],"delivery":[22],"to":[24,38,47,50],"its":[25],"customer,":[26],"when":[27],"the":[28,31,40,45,51,66,96,112],"of":[30,72],"complete.":[34],"The":[35,53],"objective":[36],"minimize":[39],"taken":[42],"for":[43,95,111],"all":[44],"jobs":[46],"be":[48,76],"delivered":[49],"customers.":[52],"strongly":[56],"NP-hard":[57],"in":[58],"general.":[59],"In":[60],"this":[61],"study,":[62],"we":[63],"show":[64],"that":[65],"case":[67,97,113],"fixed":[70,91],"number":[71],"intervals":[74],"can":[75],"solved":[77],"by":[78],"pseudo-polynomial":[80],"algorithm,":[82],"while":[83],"no":[84],"polynomial":[85,106],"approximation":[87,108],"algorithm":[88],"performance":[92],"ratio":[93],"exists":[94],"two":[99],"also":[103],"develop":[104],"scheme":[109],"(PTAS)":[110],"interval.":[118]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}