{"id":"https://openalex.org/W2124643914","doi":"https://doi.org/10.1109/ramech.2004.1438929","title":"Task scheduling in manufacturing systems based on an efficient branch and bound algorithm","display_name":"Task scheduling in manufacturing systems based on an efficient branch and bound algorithm","publication_year":2005,"publication_date":"2005-06-15","ids":{"openalex":"https://openalex.org/W2124643914","doi":"https://doi.org/10.1109/ramech.2004.1438929","mag":"2124643914"},"language":"en","primary_location":{"id":"doi:10.1109/ramech.2004.1438929","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ramech.2004.1438929","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Conference on Robotics, Automation and Mechatronics, 2004.","raw_type":"proceedings-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/A5017669587","display_name":"Abolfazl Jalilvand","orcid":"https://orcid.org/0000-0002-2454-7444"},"institutions":[{"id":"https://openalex.org/I41832843","display_name":"University of Tabriz","ror":"https://ror.org/01papkj44","country_code":"IR","type":"education","lineage":["https://openalex.org/I41832843"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"A. Jalilvand","raw_affiliation_strings":["Faculty of Electrical Engineering, University of Tabriz, Tabriz, Iran","Fac. of Electr. Eng., Tabriz Univ., Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering, University of Tabriz, Tabriz, Iran","institution_ids":["https://openalex.org/I41832843"]},{"raw_affiliation_string":"Fac. of Electr. Eng., Tabriz Univ., Iran","institution_ids":["https://openalex.org/I41832843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009010539","display_name":"Sohrab Khanmohammadi","orcid":"https://orcid.org/0000-0001-5110-9442"},"institutions":[{"id":"https://openalex.org/I41832843","display_name":"University of Tabriz","ror":"https://ror.org/01papkj44","country_code":"IR","type":"education","lineage":["https://openalex.org/I41832843"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"S. Khanmohammadi","raw_affiliation_strings":["Faculty of Electrical Engineering, University of Tabriz, Tabriz, Iran","Fac. of Electr. Eng., Tabriz Univ., Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering, University of Tabriz, Tabriz, Iran","institution_ids":["https://openalex.org/I41832843"]},{"raw_affiliation_string":"Fac. of Electr. Eng., Tabriz Univ., Iran","institution_ids":["https://openalex.org/I41832843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I41832843"],"apc_list":null,"apc_paid":null,"fwci":2.5922,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.90284275,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":null,"first_page":"271","last_page":"276"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9995999932289124,"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.9995999932289124,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.995199978351593,"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/branch-and-bound","display_name":"Branch and bound","score":0.7188001275062561},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.681568443775177},{"id":"https://openalex.org/keywords/petri-net","display_name":"Petri net","score":0.6657832860946655},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6335778832435608},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5843935012817383},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.5650932192802429},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5186294913291931},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.4880565404891968},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.47377896308898926},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.45686858892440796},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42332717776298523},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3952091932296753},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39233046770095825},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.33233073353767395},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15551519393920898},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.08905962109565735}],"concepts":[{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.7188001275062561},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.681568443775177},{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.6657832860946655},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6335778832435608},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5843935012817383},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.5650932192802429},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5186294913291931},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.4880565404891968},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.47377896308898926},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.45686858892440796},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42332717776298523},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3952091932296753},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39233046770095825},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.33233073353767395},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15551519393920898},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.08905962109565735},{"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/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0},{"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/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ramech.2004.1438929","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ramech.2004.1438929","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Conference on Robotics, Automation and Mechatronics, 2004.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6899999976158142,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1521641050","https://openalex.org/W1996109622","https://openalex.org/W2080930596","https://openalex.org/W2106659191","https://openalex.org/W2129346526","https://openalex.org/W2147882847","https://openalex.org/W2327245257","https://openalex.org/W2475640289","https://openalex.org/W6701254426"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2397293317","https://openalex.org/W2377713709","https://openalex.org/W2167574351","https://openalex.org/W2225350526","https://openalex.org/W2949165180","https://openalex.org/W2838819579","https://openalex.org/W131757205","https://openalex.org/W2538210412","https://openalex.org/W2384952691"],"abstract_inverted_index":{"The":[0,50],"branch":[1,33],"and":[2,34],"bound":[3,35],"(BB)":[4],"algorithm":[5,36,51],"is":[6,52,66],"one":[7],"of":[8],"the":[9,15,32,45],"common":[10],"used":[11,67],"methods":[12],"in":[13,19],"solving":[14],"task":[16],"scheduling":[17,60],"problems":[18],"manufacturing":[20],"systems.":[21],"In":[22],"this":[23,43],"paper,":[24],"we":[25],"introduced":[26],"a":[27,38,55,63],"new":[28],"method":[29,44],"to":[30,54],"apply":[31],"with":[37],"reduced":[39],"memory":[40],"size.":[41],"By":[42],"running":[46],"time":[47],"decreases":[48],"considerably.":[49],"applied":[53],"combinational":[56],"discrete":[57],"job":[58],"shop":[59],"system,":[61],"where":[62],"Petri":[64],"net":[65],"for":[68],"modeling.":[69]},"counts_by_year":[],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}