{"id":"https://openalex.org/W1582089591","doi":"https://doi.org/10.1109/icsmc.2002.1175716","title":"Solving the cyclic job shop scheduling problem with linear precedence constraints using CP techniques","display_name":"Solving the cyclic job shop scheduling problem with linear precedence constraints using CP techniques","publication_year":2003,"publication_date":"2003-08-27","ids":{"openalex":"https://openalex.org/W1582089591","doi":"https://doi.org/10.1109/icsmc.2002.1175716","mag":"1582089591"},"language":"en","primary_location":{"id":"doi:10.1109/icsmc.2002.1175716","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsmc.2002.1175716","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"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/A5110720749","display_name":"Fr\u00e9d\u00e9ric Boussemart","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"F. Boussemart","raw_affiliation_strings":["CRIL, Rue de l'universite, Lens Cedex, FRANCE"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CRIL, Rue de l'universite, Lens Cedex, FRANCE","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050042916","display_name":"Guillaume Cavory","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"G. Cavory","raw_affiliation_strings":["CRIL, Rue de l'universite, Lens Cedex, FRANCE"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CRIL, Rue de l'universite, Lens Cedex, FRANCE","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056232610","display_name":"Christophe Lecoutre","orcid":"https://orcid.org/0000-0002-2205-6545"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"C. Lecoutre","raw_affiliation_strings":["CRIL, Rue de l'universite, Lens Cedex, FRANCE"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CRIL, Rue de l'universite, Lens Cedex, FRANCE","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1749,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.43729487,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"vol.7","issue":null,"first_page":"6","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9994999766349792,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9969000220298767,"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/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.9833999872207642,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.7068036794662476},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.6946877241134644},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.6591699123382568},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.6171550750732422},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.6157963275909424},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5615209937095642},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5595112442970276},{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.5071218013763428},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4980800151824951},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.4653205871582031},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.46361643075942993},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42323291301727295},{"id":"https://openalex.org/keywords/job-shop","display_name":"Job shop","score":0.42228826880455017},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.3778854310512543},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3111761808395386},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.13502877950668335},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.12684187293052673},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09685531258583069}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7068036794662476},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.6946877241134644},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.6591699123382568},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.6171550750732422},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.6157963275909424},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5615209937095642},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5595112442970276},{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.5071218013763428},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4980800151824951},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.4653205871582031},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.46361643075942993},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42323291301727295},{"id":"https://openalex.org/C2777243215","wikidata":"https://www.wikidata.org/wiki/Q1493226","display_name":"Job shop","level":5,"score":0.42228826880455017},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.3778854310512543},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3111761808395386},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.13502877950668335},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.12684187293052673},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09685531258583069},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"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/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"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":1,"locations":[{"id":"doi:10.1109/icsmc.2002.1175716","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsmc.2002.1175716","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"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.7400000095367432}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W86946307","https://openalex.org/W127040706","https://openalex.org/W1522863580","https://openalex.org/W1585431002","https://openalex.org/W1663815463","https://openalex.org/W1667614912","https://openalex.org/W1960236202","https://openalex.org/W2016738003","https://openalex.org/W2019012672","https://openalex.org/W2045136239","https://openalex.org/W2060975749","https://openalex.org/W2068852367","https://openalex.org/W2119456262","https://openalex.org/W2135432705","https://openalex.org/W2137333349","https://openalex.org/W2165372647","https://openalex.org/W2227618531","https://openalex.org/W3004796262","https://openalex.org/W4301173492","https://openalex.org/W6635079311"],"related_works":["https://openalex.org/W1486916474","https://openalex.org/W4303044088","https://openalex.org/W2097415053","https://openalex.org/W2032348095","https://openalex.org/W2049055139","https://openalex.org/W2140769824","https://openalex.org/W115413730","https://openalex.org/W2524435840","https://openalex.org/W2520084020","https://openalex.org/W2156897434"],"abstract_inverted_index":{"A":[0],"cyclic":[1,55],"scheduling":[2,58],"problem":[3,6,59,66,74],"is":[4,96,114],"a":[5,13,21,71,76,91,112,122],"which,":[7],"under":[8],"the":[9,47,54,82,85,106],"requirement":[10],"of":[11,16,19,24,31,84],"respecting":[12],"finite":[14,22],"set":[15,23],"constraints":[17],"consists":[18],"ordering":[20],"tasks":[25],"occurring":[26],"in":[27],"an":[28,118],"indefinite":[29],"number":[30],"times.":[32],"In":[33],"this":[34,65],"paper,":[35],"we":[36,88],"propose,":[37],"by":[38,46],"employing":[39],"different":[40],"techniques":[41],"that":[42,90],"have":[43],"been":[44],"developed":[45],"constraint":[48,72,77],"programming":[49],"(CP)":[50],"community,":[51],"to":[52,117],"attack":[53],"job":[56],"shop":[57],"with":[60],"linear":[61],"precedence":[62],"constraints.":[63],"Indeed,":[64],"can":[67,125],"be":[68,126],"cut":[69],"as":[70],"satisfaction":[73],"or":[75],"optimization":[78],"problem.":[79],"By":[80],"limiting":[81],"periodicity":[83,124],"searched":[86],"solution,":[87],"show":[89],"complete":[92],"tree":[93],"search":[94],"approach":[95],"viable":[97],"since":[98,121],"it":[99],"allows":[100],"giving":[101],"satisfactory":[102],"results":[103],"while":[104],"minimizing":[105],"overall":[107],"execution":[108],"time.":[109],"Furthermore,":[110],"such":[111],"solution":[113],"more":[115],"adaptable":[116],"industrial":[119],"context":[120],"limited":[123],"easily":[127],"exploited.":[128]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}