{"id":"https://openalex.org/W4412721815","doi":"https://doi.org/10.1051/ro/2025109","title":"A MILP model to minimize total tardiness in a job shop scheduling problem with blocking and no-wait constraints","display_name":"A MILP model to minimize total tardiness in a job shop scheduling problem with blocking and no-wait constraints","publication_year":2025,"publication_date":"2025-07-29","ids":{"openalex":"https://openalex.org/W4412721815","doi":"https://doi.org/10.1051/ro/2025109"},"language":"en","primary_location":{"id":"doi:10.1051/ro/2025109","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ro/2025109","pdf_url":null,"source":{"id":"https://openalex.org/S4393919633","display_name":"RAIRO. Operations research","issn_l":"2804-7303","issn":["2804-7303"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1051/ro/2025109","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5092496992","display_name":"Zineb Lissioued","orcid":null},"institutions":[{"id":"https://openalex.org/I157169809","display_name":"University of Sciences and Technology Houari Boumediene","ror":"https://ror.org/02kb89c09","country_code":"DZ","type":"education","lineage":["https://openalex.org/I157169809"]}],"countries":["DZ"],"is_corresponding":true,"raw_author_name":"Zineb Lissioued","raw_affiliation_strings":["LaROMaD Laboratory, Faculty of Mathematics, University of Science and Technology Houari Boumediene, Bab Ezzouar, Algiers, Algeria"],"affiliations":[{"raw_affiliation_string":"LaROMaD Laboratory, Faculty of Mathematics, University of Science and Technology Houari Boumediene, Bab Ezzouar, Algiers, Algeria","institution_ids":["https://openalex.org/I157169809"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051765211","display_name":"Samia Ourari","orcid":null},"institutions":[{"id":"https://openalex.org/I3121272148","display_name":"University of Boumerdes","ror":"https://ror.org/02dveg925","country_code":"DZ","type":"education","lineage":["https://openalex.org/I3121272148"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Samia Ourari","raw_affiliation_strings":["LIST laboratory, Faculty of Technology, University of M'hamed Bougara of Boumerdes, Boumerdes, Algeria"],"affiliations":[{"raw_affiliation_string":"LIST laboratory, Faculty of Technology, University of M'hamed Bougara of Boumerdes, Boumerdes, Algeria","institution_ids":["https://openalex.org/I3121272148"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015062900","display_name":"Hac\u00e8ne A\u00eft Haddad\u00e8ne","orcid":"https://orcid.org/0000-0001-8808-850X"},"institutions":[{"id":"https://openalex.org/I157169809","display_name":"University of Sciences and Technology Houari Boumediene","ror":"https://ror.org/02kb89c09","country_code":"DZ","type":"education","lineage":["https://openalex.org/I157169809"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Hac\u00e8ne Ait Haddad\u00e8ne","raw_affiliation_strings":["LaROMaD Laboratory, Faculty of Mathematics, University of Science and Technology Houari Boumediene, Bab Ezzouar, Algiers, Algeria"],"affiliations":[{"raw_affiliation_string":"LaROMaD Laboratory, Faculty of Mathematics, University of Science and Technology Houari Boumediene, Bab Ezzouar, Algiers, Algeria","institution_ids":["https://openalex.org/I157169809"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5092496992"],"corresponding_institution_ids":["https://openalex.org/I157169809"],"apc_list":null,"apc_paid":null,"fwci":1.3199,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.84285565,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":"59","issue":"5","first_page":"2545","last_page":"2558"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.998199999332428,"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.998199999332428,"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/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9348000288009644,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9215999841690063,"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/tardiness","display_name":"Tardiness","score":0.9404265284538269},{"id":"https://openalex.org/keywords/blocking","display_name":"Blocking (statistics)","score":0.743325412273407},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.604436993598938},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.543596625328064},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5251474380493164},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5176889896392822},{"id":"https://openalex.org/keywords/job-shop","display_name":"Job shop","score":0.42190021276474},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.38945695757865906},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.33209818601608276},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18377050757408142},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1026759147644043}],"concepts":[{"id":"https://openalex.org/C2778047078","wikidata":"https://www.wikidata.org/wiki/Q82299449","display_name":"Tardiness","level":4,"score":0.9404265284538269},{"id":"https://openalex.org/C144745244","wikidata":"https://www.wikidata.org/wiki/Q4927286","display_name":"Blocking (statistics)","level":2,"score":0.743325412273407},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.604436993598938},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.543596625328064},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5251474380493164},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5176889896392822},{"id":"https://openalex.org/C2777243215","wikidata":"https://www.wikidata.org/wiki/Q1493226","display_name":"Job shop","level":5,"score":0.42190021276474},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.38945695757865906},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.33209818601608276},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18377050757408142},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1026759147644043},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1051/ro/2025109","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ro/2025109","pdf_url":null,"source":{"id":"https://openalex.org/S4393919633","display_name":"RAIRO. Operations research","issn_l":"2804-7303","issn":["2804-7303"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1051/ro/2025109","is_oa":true,"landing_page_url":"https://doi.org/10.1051/ro/2025109","pdf_url":null,"source":{"id":"https://openalex.org/S4393919633","display_name":"RAIRO. Operations research","issn_l":"2804-7303","issn":["2804-7303"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W24604221","https://openalex.org/W1505463034","https://openalex.org/W1947350933","https://openalex.org/W2015465419","https://openalex.org/W2028900733","https://openalex.org/W2049967755","https://openalex.org/W2076785727","https://openalex.org/W2077266619","https://openalex.org/W2149884725","https://openalex.org/W2606343952","https://openalex.org/W2607795493","https://openalex.org/W2919801092","https://openalex.org/W4255654664"],"related_works":["https://openalex.org/W3097192092","https://openalex.org/W3029619930","https://openalex.org/W2061005265","https://openalex.org/W74759090","https://openalex.org/W1980879778","https://openalex.org/W3216729967","https://openalex.org/W2900006172","https://openalex.org/W2967782293","https://openalex.org/W2146297781","https://openalex.org/W2612484291"],"abstract_inverted_index":{"This":[0,175],"paper":[1],"deals":[2],"with":[3],"job":[4,30,66,143],"shop":[5,144],"scheduling":[6,145],"problem":[7,108,149,196],"(JSS)":[8],"where":[9],"both":[10],"blocking":[11,19,96,139],"and":[12,35,97,127,140,189],"no-wait":[13,58,98,141],"constraints":[14,20],"(BNW)":[15,142],"are":[16,21],"considered.":[17],"The":[18,57,79,147],"linked":[22],"to":[23,82,136,178,190],"storage":[24],"capacity":[25],"constraints.":[26,99],"They":[27],"appear":[28],"when":[29,64],"completed":[31],"by":[32,54,125],"a":[33,65,84,153],"machine":[34,41,47],"must":[36,67],"be":[37,68],"stored":[38],"on":[39,71,89,120,168,185,197],"this":[40,107,114],"as":[42,44,152],"long":[43],"the":[45,110,121,138,165,169,180,186,194,198],"next":[46],"that":[48,91],"will":[49],"process":[50],"it":[51],"is":[52,81,150],"occupied":[53],"another":[55],"job.":[56],"constraints,":[59],"for":[60,193],"their":[61],"part,":[62],"occur":[63],"processed":[69],"continuously":[70],"different":[72],"machines":[73,90],"without":[74],"any":[75],"interruption":[76],"between":[77],"operations.":[78],"objective":[80],"find":[83],"feasible":[85],"order":[86],"of":[87,173,182],"operations":[88],"minimizes":[92],"total":[93],"tardiness":[94],"under":[95],"To":[100,112],"our":[101,183],"knowledge,":[102],"no":[103],"study":[104],"has":[105],"treated":[106],"in":[109],"literature.":[111],"tackle":[113],"NP-hard":[115],"problem,":[116],"we":[117],"propose,":[118],"based":[119],"mathematical":[122],"model":[123,157,184],"given":[124],"Lange":[126],"Werner":[128],"[":[129],"J.":[130],"Sched":[131],".":[132],"21":[133],"(2018)":[134],"191\u2013207],":[135],"solve":[137],"problem.":[146],"BNW-JSS":[148,195],"formalized":[151],"mixed-integer":[154],"linear":[155],"programming":[156],"(MILP).":[158],"Several":[159],"numerical":[160],"experiments":[161],"were":[162],"performed":[163],"using":[164],"CPLEX":[166],"solver":[167],"classical":[170],"benchmark":[171],"instances":[172],"Lawrence.":[174],"allowed":[176],"us":[177],"assess":[179],"effectiveness":[181],"one":[187],"hand":[188],"report":[191],"results":[192],"other":[199],"hand.":[200]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}