{"id":"https://openalex.org/W2810001268","doi":"https://doi.org/10.1109/codit.2018.8394831","title":"Maximum Lateness Minimization on Two-Parallel Machine with a Non-availability Interval","display_name":"Maximum Lateness Minimization on Two-Parallel Machine with a Non-availability Interval","publication_year":2018,"publication_date":"2018-04-01","ids":{"openalex":"https://openalex.org/W2810001268","doi":"https://doi.org/10.1109/codit.2018.8394831","mag":"2810001268"},"language":"en","primary_location":{"id":"doi:10.1109/codit.2018.8394831","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2018.8394831","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)","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/A5033668793","display_name":"Gais Alhadi","orcid":"https://orcid.org/0000-0001-6676-3594"},"institutions":[{"id":"https://openalex.org/I4387152457","display_name":"Laboratoire de Conception, Optimisation et Mod\u00e9lisation des Syst\u00e8mes","ror":"https://ror.org/04x6jg419","country_code":"FR","type":"facility","lineage":["https://openalex.org/I4387152457","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I78157869","display_name":"University of Gezira","ror":"https://ror.org/001mf9v16","country_code":"SD","type":"education","lineage":["https://openalex.org/I78157869"]},{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]}],"countries":["FR","SD"],"is_corresponding":false,"raw_author_name":"Gais Alhadi","raw_affiliation_strings":["Faculty of Mathematical and Computer Sciences, University of Gezira, Wad-Madani, Sudan","U. of G. - University of Gezira [Wad Madani, Sudan] [University of al-Jazirah] = \u062c\u0627\u0645\u0639\u0629 \u0627\u0644\u062c\u0632\u064a\u0631\u0629 (Wad Madani \u2013 Soudan - Sudan)","LCOMS - Laboratoire de Conception, Optimisation et Mod\u00e9lisation des Syst\u00e8mes (LCOMS EA7306, Universit\u00e9 de Lorraine, Metz 57000, France - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Mathematical and Computer Sciences, University of Gezira, Wad-Madani, Sudan","institution_ids":["https://openalex.org/I78157869"]},{"raw_affiliation_string":"U. of G. - University of Gezira [Wad Madani, Sudan] [University of al-Jazirah] = \u062c\u0627\u0645\u0639\u0629 \u0627\u0644\u062c\u0632\u064a\u0631\u0629 (Wad Madani \u2013 Soudan - Sudan)","institution_ids":["https://openalex.org/I78157869"]},{"raw_affiliation_string":"LCOMS - Laboratoire de Conception, Optimisation et Mod\u00e9lisation des Syst\u00e8mes (LCOMS EA7306, Universit\u00e9 de Lorraine, Metz 57000, France - France)","institution_ids":["https://openalex.org/I4387152457","https://openalex.org/I90183372"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075247612","display_name":"Imed Kacem","orcid":"https://orcid.org/0000-0001-6649-7257"},"institutions":[{"id":"https://openalex.org/I4387152457","display_name":"Laboratoire de Conception, Optimisation et Mod\u00e9lisation des Syst\u00e8mes","ror":"https://ror.org/04x6jg419","country_code":"FR","type":"facility","lineage":["https://openalex.org/I4387152457","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Imed Kacem","raw_affiliation_strings":["LCOMS Laboratory, University of Lorraine, Metz, France","LCOMS - Laboratoire de Conception, Optimisation et Mod\u00e9lisation des Syst\u00e8mes (LCOMS EA7306, Universit\u00e9 de Lorraine, Metz 57000, France - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LCOMS Laboratory, University of Lorraine, Metz, France","institution_ids":["https://openalex.org/I4387152457","https://openalex.org/I90183372"]},{"raw_affiliation_string":"LCOMS - Laboratoire de Conception, Optimisation et Mod\u00e9lisation des Syst\u00e8mes (LCOMS EA7306, Universit\u00e9 de Lorraine, Metz 57000, France - France)","institution_ids":["https://openalex.org/I4387152457","https://openalex.org/I90183372"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053521274","display_name":"Pierre Laroche","orcid":"https://orcid.org/0000-0002-2191-1335"},"institutions":[{"id":"https://openalex.org/I4387152457","display_name":"Laboratoire de Conception, Optimisation et Mod\u00e9lisation des Syst\u00e8mes","ror":"https://ror.org/04x6jg419","country_code":"FR","type":"facility","lineage":["https://openalex.org/I4387152457","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Pierre Laroche","raw_affiliation_strings":["LCOMS Laboratory, University of Lorraine, Metz, France","LCOMS - Laboratoire de Conception, Optimisation et Mod\u00e9lisation des Syst\u00e8mes (LCOMS EA7306, Universit\u00e9 de Lorraine, Metz 57000, France - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LCOMS Laboratory, University of Lorraine, Metz, France","institution_ids":["https://openalex.org/I4387152457","https://openalex.org/I90183372"]},{"raw_affiliation_string":"LCOMS - Laboratoire de Conception, Optimisation et Mod\u00e9lisation des Syst\u00e8mes (LCOMS EA7306, Universit\u00e9 de Lorraine, Metz 57000, France - France)","institution_ids":["https://openalex.org/I4387152457","https://openalex.org/I90183372"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102143946","display_name":"Izzeldin M. Osman","orcid":null},"institutions":[{"id":"https://openalex.org/I9353105","display_name":"Sudan University of Science and Technology","ror":"https://ror.org/02fwtg066","country_code":"SD","type":"education","lineage":["https://openalex.org/I9353105"]}],"countries":["SD"],"is_corresponding":false,"raw_author_name":"Izzeldin M. Osman","raw_affiliation_strings":["Sudan University of Science and Technology, Khartoum, Sudan","SUST - Sudan University of Science and Technology  [Khartoum] (Sudan)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sudan University of Science and Technology, Khartoum, Sudan","institution_ids":["https://openalex.org/I9353105"]},{"raw_affiliation_string":"SUST - Sudan University of Science and Technology  [Khartoum] (Sudan)","institution_ids":["https://openalex.org/I9353105"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"757","last_page":"762"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9955000281333923,"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.9865000247955322,"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/interval","display_name":"Interval (graph theory)","score":0.6964980363845825},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6170827746391296},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.5914755463600159},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.590233564376831},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5900739431381226},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5823658108711243},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5752853155136108},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5695522427558899},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5345385074615479},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.534130334854126},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.522165060043335},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4648503363132477},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3977794051170349},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37698590755462646},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.17455312609672546},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.07826271653175354}],"concepts":[{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.6964980363845825},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6170827746391296},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.5914755463600159},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.590233564376831},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5900739431381226},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5823658108711243},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5752853155136108},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5695522427558899},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5345385074615479},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.534130334854126},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.522165060043335},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4648503363132477},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3977794051170349},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37698590755462646},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.17455312609672546},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.07826271653175354},{"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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/codit.2018.8394831","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2018.8394831","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 5th International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-04000391v1","is_oa":false,"landing_page_url":"https://hal.univ-lorraine.fr/hal-04000391","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2018 5th International Conference on Control, Decision and Information Technologies (CoDIT), Apr 2018, Thessaloniki, France. pp.757-762, ⟨10.1109/CoDIT.2018.8394831⟩","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.5699999928474426,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1997449826","https://openalex.org/W1999566861","https://openalex.org/W2016371955","https://openalex.org/W2035966498","https://openalex.org/W2048358792","https://openalex.org/W2080316412","https://openalex.org/W2212575943","https://openalex.org/W2502122805","https://openalex.org/W2524755176","https://openalex.org/W2620541949","https://openalex.org/W2963430242"],"related_works":["https://openalex.org/W1815446007","https://openalex.org/W2783992526","https://openalex.org/W2962917430","https://openalex.org/W2048358792","https://openalex.org/W2028468530","https://openalex.org/W1694364829","https://openalex.org/W1903284337","https://openalex.org/W1972853793","https://openalex.org/W2399100966","https://openalex.org/W2009846993"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,46,69,75],"consider":[4],"the":[5,18,31,49,77],"two-parallel":[6],"machine":[7],"scheduling":[8],"problem":[9,32,50],"with":[10],"a":[11,25,34,41,63],"non-availability":[12],"interval.":[13],"We":[14,28,39],"aim":[15],"to":[16],"minimize":[17],"maximum":[19],"lateness":[20],"when":[21],"every":[22],"job":[23],"has":[24,33,51,62],"positive":[26],"tail.":[27],"show":[29,47],"that":[30,48],"constant":[35],"polynomial":[36,65],"approximation":[37],"algorithm.":[38],"present":[40,70],"dynamic":[42],"programming":[43],"algorithm":[44],"and":[45,74],"an":[52],"FPTAS":[53,61],"(Fully":[54],"Polynomial":[55],"Time":[56],"Approximation":[57],"Algorithm).":[58],"The":[59],"proposed":[60],"strongly":[64],"running":[66],"time.":[67],"Finally,":[68],"some":[71],"numerical":[72],"experiments":[73],"analyze":[76],"obtained":[78],"results.":[79]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}