{"id":"https://openalex.org/W2153168201","doi":"https://doi.org/10.1109/icsmc.2007.4413614","title":"Job shop deadlock-free scheduling using Mixed Integer Programming and rank matrices","display_name":"Job shop deadlock-free scheduling using Mixed Integer Programming and rank matrices","publication_year":2007,"publication_date":"2007-10-01","ids":{"openalex":"https://openalex.org/W2153168201","doi":"https://doi.org/10.1109/icsmc.2007.4413614","mag":"2153168201"},"language":"en","primary_location":{"id":"doi:10.1109/icsmc.2007.4413614","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsmc.2007.4413614","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE International Conference on Systems, Man and Cybernetics","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/A5048446115","display_name":"Sherif A. Fahmy","orcid":"https://orcid.org/0000-0001-8963-2220"},"institutions":[{"id":"https://openalex.org/I46247651","display_name":"University of Manitoba","ror":"https://ror.org/02gfys938","country_code":"CA","type":"education","lineage":["https://openalex.org/I46247651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Sherif A. Fahmy","raw_affiliation_strings":["University of Manitoba Winnipeg, Winnipeg, MB, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Manitoba Winnipeg, Winnipeg, MB, Canada","institution_ids":["https://openalex.org/I46247651"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013471946","display_name":"Tarek Y. ElMekkawy","orcid":"https://orcid.org/0000-0002-6141-9687"},"institutions":[{"id":"https://openalex.org/I46247651","display_name":"University of Manitoba","ror":"https://ror.org/02gfys938","country_code":"CA","type":"education","lineage":["https://openalex.org/I46247651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Tarek Y. ElMekkawy","raw_affiliation_strings":["University of Manitoba Winnipeg, Winnipeg, MB, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Manitoba Winnipeg, Winnipeg, MB, Canada","institution_ids":["https://openalex.org/I46247651"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103734454","display_name":"Subramaniam Balakrishnan","orcid":null},"institutions":[{"id":"https://openalex.org/I46247651","display_name":"University of Manitoba","ror":"https://ror.org/02gfys938","country_code":"CA","type":"education","lineage":["https://openalex.org/I46247651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Subramaniam Balakrishnan","raw_affiliation_strings":["University of Manitoba Winnipeg, Winnipeg, MB, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Manitoba Winnipeg, Winnipeg, MB, Canada","institution_ids":["https://openalex.org/I46247651"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I46247651"],"apc_list":null,"apc_paid":null,"fwci":1.5615,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.8368394,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"2","issue":null,"first_page":"2776","last_page":"2781"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9972000122070312,"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.9959999918937683,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.700672447681427},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6799541115760803},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.5934585332870483},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5806246995925903},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5779720544815063},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5429217219352722},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5035595297813416},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.4555134177207947},{"id":"https://openalex.org/keywords/blocking","display_name":"Blocking (statistics)","score":0.4492361843585968},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.26019996404647827},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20824259519577026},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1958678960800171},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.14635393023490906},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0939948558807373}],"concepts":[{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.700672447681427},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6799541115760803},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.5934585332870483},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5806246995925903},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5779720544815063},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5429217219352722},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5035595297813416},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.4555134177207947},{"id":"https://openalex.org/C144745244","wikidata":"https://www.wikidata.org/wiki/Q4927286","display_name":"Blocking (statistics)","level":2,"score":0.4492361843585968},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.26019996404647827},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20824259519577026},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1958678960800171},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.14635393023490906},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0939948558807373},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icsmc.2007.4413614","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsmc.2007.4413614","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE International Conference on Systems, Man and Cybernetics","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.7099999785423279}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1523801914","https://openalex.org/W1564357447","https://openalex.org/W1587734337","https://openalex.org/W1977456355","https://openalex.org/W1979034647","https://openalex.org/W1979349468","https://openalex.org/W1982657059","https://openalex.org/W1991226180","https://openalex.org/W2015814347","https://openalex.org/W2032602114","https://openalex.org/W2051488135","https://openalex.org/W2113073393","https://openalex.org/W2121942160","https://openalex.org/W2134040953","https://openalex.org/W2136715355","https://openalex.org/W2162462347","https://openalex.org/W6645448466","https://openalex.org/W6663442196"],"related_works":["https://openalex.org/W2392835431","https://openalex.org/W2126932387","https://openalex.org/W1965371215","https://openalex.org/W2353762239","https://openalex.org/W2185938410","https://openalex.org/W2484966135","https://openalex.org/W2015050211","https://openalex.org/W3172150420","https://openalex.org/W2107725657","https://openalex.org/W2105060405"],"abstract_inverted_index":{"The":[0],"goal":[1],"of":[2,32,48,89,97],"this":[3,67],"paper":[4],"is":[5,59],"to":[6,45,62,73,78,105],"propose":[7],"a":[8,33,90],"novel":[9],"mixed":[10],"integer":[11],"programming":[12],"(MIP)":[13],"formulation":[14],"for":[15,41,80],"the":[16,30,42,46,49,64,75,87,95,98,102],"deadlock-free":[17],"job":[18],"shop":[19],"scheduling":[20],"problem":[21],"with":[22],"limited":[23],"capacity":[24,38],"buffers.":[25],"Two":[26],"scenarios":[27],"are":[28,71,111],"considered;":[29],"presence":[31,88],"central":[34,91],"buffer,":[35],"and":[36,77,83,101],"unit":[37],"input":[39],"buffers":[40],"machines.":[43],"Due":[44],"complexity":[47],"problem,":[50],"an":[51],"operations":[52],"insertion":[53],"heuristic":[54],"based":[55],"on":[56],"rank":[57,69],"matrices":[58,70],"also":[60],"proposed":[61],"solve":[63],"problem.":[65],"In":[66],"heuristic,":[68,103],"used":[72],"generate":[74],"schedules":[76],"check":[79],"deadlock":[81],"situations":[82],"machine":[84],"blocking":[85],"considering":[86],"buffer.":[92],"To":[93],"evaluate":[94],"performances":[96],"mathematical":[99],"models":[100],"comparisons":[104],"other":[106],"approaches":[107],"reported":[108],"in":[109],"literature":[110],"conducted.":[112]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}