{"id":"https://openalex.org/W1498024500","doi":"https://doi.org/10.23919/ecc.2001.7076049","title":"Combining sectional processing algorithm and compound incremental cost based list scheduling algorithm for long-horizon job-shop scheduling problems","display_name":"Combining sectional processing algorithm and compound incremental cost based list scheduling algorithm for long-horizon job-shop scheduling problems","publication_year":2001,"publication_date":"2001-09-01","ids":{"openalex":"https://openalex.org/W1498024500","doi":"https://doi.org/10.23919/ecc.2001.7076049","mag":"1498024500"},"language":"en","primary_location":{"id":"doi:10.23919/ecc.2001.7076049","is_oa":false,"landing_page_url":"https://doi.org/10.23919/ecc.2001.7076049","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2001 European Control Conference (ECC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5102126734","display_name":"Shin-Yeu Lin","orcid":null},"institutions":[{"id":"https://openalex.org/I148366613","display_name":"National Yang Ming Chiao Tung University","ror":"https://ror.org/00se2k293","country_code":"TW","type":"education","lineage":["https://openalex.org/I148366613"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Shin-Yeu Lin","raw_affiliation_strings":["Dept. of Electrical & Control Engineering, National Chiao Tnng University, Hsinchu, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical & Control Engineering, National Chiao Tnng University, Hsinchu, Taiwan","institution_ids":["https://openalex.org/I148366613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038133685","display_name":"Jui-Yen Cheng","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jui-Yen Cheng","raw_affiliation_strings":["Way Tech, 11th fl., 253 Min-Sheng Rd., Hsinchu, Taiwan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Way Tech, 11th fl., 253 Min-Sheng Rd., Hsinchu, Taiwan","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08736168,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1029","last_page":"1033"},"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.9979000091552734,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9908999800682068,"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/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.6875236630439758},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.6680781841278076},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.6649401187896729},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6564038395881653},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.6493927836418152},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6120212078094482},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.5903235077857971},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5656539797782898},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5499333143234253},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.5264863967895508},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.47937658429145813},{"id":"https://openalex.org/keywords/job-scheduler","display_name":"Job scheduler","score":0.4508481025695801},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44092318415641785},{"id":"https://openalex.org/keywords/time-horizon","display_name":"Time horizon","score":0.4296988248825073},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.4224422872066498},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19936993718147278},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.06779837608337402}],"concepts":[{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.6875236630439758},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.6680781841278076},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.6649401187896729},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6564038395881653},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.6493927836418152},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6120212078094482},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.5903235077857971},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5656539797782898},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5499333143234253},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.5264863967895508},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.47937658429145813},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.4508481025695801},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44092318415641785},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.4296988248825073},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.4224422872066498},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19936993718147278},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.06779837608337402},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/ecc.2001.7076049","is_oa":false,"landing_page_url":"https://doi.org/10.23919/ecc.2001.7076049","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2001 European Control Conference (ECC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.699999988079071,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1496145293","https://openalex.org/W2012440004","https://openalex.org/W2016573888","https://openalex.org/W2097984481","https://openalex.org/W2134462622","https://openalex.org/W2148393763","https://openalex.org/W2164239387","https://openalex.org/W2164802608"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W4300092030","https://openalex.org/W2167574351","https://openalex.org/W2372008037","https://openalex.org/W1545991362","https://openalex.org/W4386580182","https://openalex.org/W2377713709","https://openalex.org/W2225350526","https://openalex.org/W2172075652","https://openalex.org/W2060984508"],"abstract_inverted_index":{"In":[0,43],"this":[1],"paper,":[2],"we":[3,47],"combine":[4],"the":[5,10,28,40,51,59,63,97,111,121,124],"sectional":[6],"processing":[7],"algorithm":[8,17,25,56,85,92],"with":[9,39],"compound":[11],"incremental":[12],"cost":[13],"based":[14],"list":[15],"scheduling":[16,22,84,89,98],"to":[18,79,95],"solve":[19,96],"long-horizon":[20],"job-shop":[21,88],"problems.":[23,90],"Our":[24],"has":[26],"achieved":[27],"reduction":[29,64],"of":[30,54,65,120,123],"both":[31,66],"CPU":[32,67],"times":[33,68],"and":[34,69],"objective":[35,70],"values":[36,71],"in":[37],"comparing":[38],"original":[41],"method.":[42],"our":[44,55],"simulation":[45],"results,":[46],"observe":[48],"that":[49],"when":[50],"section":[52,101],"length":[53],"approximately":[57,73],"equals":[58],"average":[60],"system":[61,125],"time,":[62],"are":[72],"optimal.":[74],"This":[75,91],"observation":[76],"leads":[77],"us":[78,94],"proposing":[80],"a":[81,103],"receding":[82],"horizon":[83],"for":[86],"infinite-horizon":[87],"allows":[93],"problem":[99],"one":[100],"at":[102],"time.":[104],"Thus,":[105],"it":[106],"will":[107],"not":[108],"only":[109],"save":[110],"computation":[112],"time":[113],"tremendously":[114],"but":[115],"also":[116],"easily":[117],"take":[118],"care":[119],"variation":[122],"configuration.":[126]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}