{"id":"https://openalex.org/W2026461811","doi":"https://doi.org/10.1109/coase.2012.6386474","title":"Scheduling model for systems with complex alternative behaviour","display_name":"Scheduling model for systems with complex alternative behaviour","publication_year":2012,"publication_date":"2012-08-01","ids":{"openalex":"https://openalex.org/W2026461811","doi":"https://doi.org/10.1109/coase.2012.6386474","mag":"2026461811"},"language":"en","primary_location":{"id":"doi:10.1109/coase.2012.6386474","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2012.6386474","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://publications.lib.chalmers.se/records/fulltext/169038/local_169038.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036504431","display_name":"Oskar Wigstr\u00f6m","orcid":"https://orcid.org/0000-0002-5881-2226"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Oskar Wigstrom","raw_affiliation_strings":["Automation Research Group, Department of Signals and Systems, Chalmers University of Technology, Gothenburg, Sweden","[Automation Research Group, Department of Signals and Systems, Chalmers University of Technology, Gothenburg, Sweden]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Automation Research Group, Department of Signals and Systems, Chalmers University of Technology, Gothenburg, Sweden","institution_ids":["https://openalex.org/I66862912"]},{"raw_affiliation_string":"[Automation Research Group, Department of Signals and Systems, Chalmers University of Technology, Gothenburg, Sweden]","institution_ids":["https://openalex.org/I66862912"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076331540","display_name":"Bengt Lennartson","orcid":"https://orcid.org/0000-0002-3406-3881"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Bengt Lennartson","raw_affiliation_strings":["Automation Research Group, Department of Signals and Systems, Chalmers University of Technology, Gothenburg, Sweden","[Automation Research Group, Department of Signals and Systems, Chalmers University of Technology, Gothenburg, Sweden]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Automation Research Group, Department of Signals and Systems, Chalmers University of Technology, Gothenburg, Sweden","institution_ids":["https://openalex.org/I66862912"]},{"raw_affiliation_string":"[Automation Research Group, Department of Signals and Systems, Chalmers University of Technology, Gothenburg, Sweden]","institution_ids":["https://openalex.org/I66862912"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I66862912"],"apc_list":null,"apc_paid":null,"fwci":3.7945,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.92661966,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"587","last_page":"593"},"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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9943000078201294,"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.9800000190734863,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7504911422729492},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.6875383853912354},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6600198149681091},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6554439067840576},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6256831288337708},{"id":"https://openalex.org/keywords/mutual-exclusion","display_name":"Mutual exclusion","score":0.5649258494377136},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5140041708946228},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.45968127250671387},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3422372043132782},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.14686495065689087},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.1305120587348938},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11944973468780518},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.10432660579681396}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7504911422729492},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.6875383853912354},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6600198149681091},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6554439067840576},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6256831288337708},{"id":"https://openalex.org/C56348326","wikidata":"https://www.wikidata.org/wiki/Q1047554","display_name":"Mutual exclusion","level":2,"score":0.5649258494377136},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5140041708946228},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.45968127250671387},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3422372043132782},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.14686495065689087},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.1305120587348938},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11944973468780518},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.10432660579681396},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/coase.2012.6386474","is_oa":false,"landing_page_url":"https://doi.org/10.1109/coase.2012.6386474","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-article"},{"id":"pmh:oai:research.chalmers.se:169038","is_oa":true,"landing_page_url":"https://research.chalmers.se/en/publication/169038","pdf_url":"http://publications.lib.chalmers.se/records/fulltext/169038/local_169038.pdf","source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},{"id":"pmh:oai:publications.lib.chalmers.se:169038","is_oa":false,"landing_page_url":"http://publications.lib.chalmers.se/publication/169038-scheduling-model-for-systems-with-complex-alternative-behaviour","pdf_url":null,"source":{"id":"https://openalex.org/S4377196470","display_name":"Chalmers Publication Library (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text.Article.Conference.PeerReviewed"}],"best_oa_location":{"id":"pmh:oai:research.chalmers.se:169038","is_oa":true,"landing_page_url":"https://research.chalmers.se/en/publication/169038","pdf_url":"http://publications.lib.chalmers.se/records/fulltext/169038/local_169038.pdf","source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.5400000214576721,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2026461811.pdf","grobid_xml":"https://content.openalex.org/works/W2026461811.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W241431212","https://openalex.org/W1552893733","https://openalex.org/W1570009768","https://openalex.org/W1587861032","https://openalex.org/W1962622810","https://openalex.org/W1969109994","https://openalex.org/W1994566591","https://openalex.org/W2027140251","https://openalex.org/W2040789431","https://openalex.org/W2046437335","https://openalex.org/W2052934732","https://openalex.org/W2059180678","https://openalex.org/W2072298242","https://openalex.org/W2083878885","https://openalex.org/W2086178978","https://openalex.org/W2087138863","https://openalex.org/W2100131857","https://openalex.org/W2124106382","https://openalex.org/W2125432310","https://openalex.org/W2134098988","https://openalex.org/W2139018750","https://openalex.org/W2141036888","https://openalex.org/W2157541676","https://openalex.org/W2166928920","https://openalex.org/W2219185070","https://openalex.org/W4309143184"],"related_works":["https://openalex.org/W3046715470","https://openalex.org/W2531084474","https://openalex.org/W4285278887","https://openalex.org/W2365237642","https://openalex.org/W2995925505","https://openalex.org/W2773399470","https://openalex.org/W2147600044","https://openalex.org/W3116484972","https://openalex.org/W2941986668","https://openalex.org/W2386868101"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"propose":[4],"a":[5,61,98],"flexible":[6],"model":[7,22,32],"for":[8,24,45,57,64,76,87],"scheduling":[9,91],"problems,":[10],"which":[11],"allows":[12],"the":[13,27,58],"modeling":[14],"of":[15,67,101],"systems":[16,80,96],"with":[17,81,97],"complex":[18],"alternative":[19],"behaviour.":[20],"This":[21,71],"could":[23],"example":[25],"facilitate":[26],"step":[28],"from":[29],"process":[30],"planning":[31],"to":[33],"optimization":[34],"model.":[35],"We":[36],"show":[37],"how":[38],"automatic":[39],"constraint":[40],"generation":[41],"can":[42],"be":[43],"performed":[44],"both":[46],"Constraint":[47],"Programming":[48,53],"and":[49],"Mixed":[50],"Integer":[51],"Linear":[52],"(MILP)":[54],"models.":[55],"Also,":[56],"MILP":[59],"case,":[60],"new":[62,72],"formulation":[63,73],"mutual":[65],"exclusion":[66],"resources":[68],"is":[69],"proposed.":[70],"works":[74],"well":[75,94],"proving":[77],"optimality":[78],"in":[79],"multiple":[82],"capacity":[83],"resources.":[84],"Some":[85],"benchmarks":[86],"such":[88],"job":[89],"shop":[90],"problems":[92],"as":[93,95],"large":[99],"number":[100],"alternatives":[102],"are":[103],"also":[104],"presented.":[105]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}