{"id":"https://openalex.org/W7208726104","doi":"https://doi.org/10.48550/arxiv.2609.04161","title":"Minimizing the makespan in job shop scheduling under conflict graph constraints","display_name":"Minimizing the makespan in job shop scheduling under conflict graph constraints","publication_year":2026,"publication_date":"2026-09-03","ids":{"openalex":"https://openalex.org/W7208726104","doi":"https://doi.org/10.48550/arxiv.2609.04161"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2609.04161","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.04161","pdf_url":"https://arxiv.org/pdf/2609.04161","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2609.04161","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5046679342","display_name":"Nour ElHouda Tellache","orcid":"https://orcid.org/0000-0002-2731-0514","observed_orcids":["https://orcid.org/0000-0002-2731-0514"]},"institutions":[{"id":"https://openalex.org/I154338468","display_name":"University of Fribourg","ror":"https://ror.org/022fs9h90","country_code":"CH","type":"education","lineage":["https://openalex.org/I154338468"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Tellache, Nour Elhouda","raw_affiliation_strings":["Decision Support & Operations Research Group , Department of Informatics , University of Fribourg , Fribourg , Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Decision Support & Operations Research Group , Department of Informatics , University of Fribourg , Fribourg , Switzerland","institution_ids":["https://openalex.org/I154338468"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014122572","display_name":"Abdennour Azerine","orcid":"https://orcid.org/0000-0003-2460-3140","observed_orcids":["https://orcid.org/0000-0003-2460-3140"]},"institutions":[{"id":"https://openalex.org/I2800745255","display_name":"Universit\u00e9 de Haute-Alsace","ror":"https://ror.org/04k8k6n84","country_code":"FR","type":"education","lineage":["https://openalex.org/I2800745255"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Azerine, Abdenour","raw_affiliation_strings":["A. Azerine , Universit\u00e9 de Haute-Alsace F-68100 Mulhouse , France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"A. Azerine , Universit\u00e9 de Haute-Alsace F-68100 Mulhouse , France","institution_ids":["https://openalex.org/I2800745255"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"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":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/T12177","display_name":"Resource-Constrained Project Scheduling","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"}},{"id":"https://openalex.org/T11773","display_name":"Healthcare Operations and Scheduling Optimization","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/job-shop-scheduling","display_name":"job shop scheduling","score":0.9990000128746033},{"id":"https://openalex.org/keywords/conflict-graph","display_name":"conflict graph","score":0.656000018119812},{"id":"https://openalex.org/keywords/makespan-minimization","display_name":"makespan minimization","score":0.9980000257492065},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.7720000147819519},{"id":"https://openalex.org/keywords/cluster-graphs","display_name":"cluster graphs","score":0.7390000224113464},{"id":"https://openalex.org/keywords/clique-partitioning","display_name":"clique partitioning","score":0.9679999947547913},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.8539999723434448},{"id":"https://openalex.org/keywords/mixed-integer-linear-formulation","display_name":"mixed-integer linear formulation","score":0.8059999942779541},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"genetic algorithm","score":0.9750000238418579},{"id":"https://openalex.org/keywords/hybrid-decoding","display_name":"hybrid decoding","score":0.7110000252723694}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.8428999781608582},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6234999895095825},{"id":"https://openalex.org/C2777243215","wikidata":"https://www.wikidata.org/wiki/Q1493226","display_name":"Job shop","level":5,"score":0.6031000018119812},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.4999000132083893},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49559998512268066},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4666999876499176},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4526999890804291},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43619999289512634},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.42590001225471497},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4203000068664551},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.3977000117301941},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3529999852180481},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3050999939441681},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.29919999837875366},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.295199990272522},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2906999886035919},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2766000032424927},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2694999873638153},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.26089999079704285},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.25769999623298645},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2531999945640564}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2609.04161","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.04161","pdf_url":"https://arxiv.org/pdf/2609.04161","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},{"id":"doi:10.48550/arxiv.2609.04161","doi":"https://doi.org/10.48550/arxiv.2609.04161","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2609.04161","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2609.04161","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.04161","pdf_url":"https://arxiv.org/pdf/2609.04161","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7208726104.pdf","grobid_xml":"https://content.openalex.org/works/W7208726104.grobid-xml"},"referenced_works_count":1,"referenced_works":["https://openalex.org/W4417183211"],"related_works":["https://openalex.org/W2631032937","https://openalex.org/W3211357163","https://openalex.org/W4366085030","https://openalex.org/W2961418885","https://openalex.org/W3124181764","https://openalex.org/W2620006440","https://openalex.org/W4408151024","https://openalex.org/W2472999647","https://openalex.org/W2518274892","https://openalex.org/W3128526261"],"abstract_inverted_index":{"We":[0,29,83],"study":[1],"the":[2,23,27,72,80,106,134,148,154],"job":[3,37,99,144],"shop":[4,38,145],"scheduling":[5],"problem":[6,39,48],"with":[7,22,34,56,121],"a":[8,31,35,68,76,86,118],"conflict":[9,73,92],"graph,":[10,78],"in":[11],"which":[12],"adjacent":[13],"jobs":[14],"cannot":[15],"be":[16],"processed":[17],"simultaneously":[18],"on":[19,53,94,130,140,159],"different":[20],"machines,":[21],"objective":[24],"of":[25],"minimizing":[26],"makespan.":[28],"establish":[30],"polynomial":[32],"equivalence":[33],"resource-constrained":[36],"having":[40],"unit-capacity":[41],"resources":[42],"and":[43,67,117,124,136,139,151],"binary":[44],"resource":[45],"requirements":[46],"The":[47],"is":[49,75],"strongly":[50],"NP-hard":[51],"even":[52],"two":[54,95,102],"machines":[55,96],"unit-time":[57,103],"operations.":[58,104],"For":[59,105],"this":[60],"setting,":[61],"we":[62,109],"derive":[63],"an":[64],"optimal-makespan":[65],"formula":[66],"linear-time":[69],"algorithm":[70,89,120,156],"when":[71,97],"graph":[74],"cluster":[77],"given":[79],"clique":[81],"partition.":[82],"also":[84],"develop":[85],"polynomial-time":[87],"$4/3$-approximation":[88],"for":[90],"arbitrary":[91],"graphs":[93],"each":[98],"has":[100],"exactly":[101],"general":[107],"problem,":[108],"propose":[110],"four":[111],"mixed-integer":[112],"linear":[113],"formulations,":[114],"lower":[115],"bounds,":[116],"genetic":[119,155],"active,":[122],"non-delay,":[123],"hybrid":[125],"decoding":[126],"procedures.":[127],"Computational":[128],"experiments":[129],"instances":[131,146],"derived":[132],"from":[133],"Lawrence":[135],"Taillard":[137],"benchmarks":[138],"randomly":[141],"generated":[142],"generalized":[143],"evaluate":[147],"proposed":[149],"methods":[150],"show":[152],"that":[153],"generally":[157],"improves":[158],"constructive":[160],"heuristics.":[161]},"counts_by_year":[],"updated_date":"2026-11-08T12:12:28.789561","created_date":"2026-09-05T00:00:00"}