{"id":"https://openalex.org/W2161593778","doi":"https://doi.org/10.1109/icsmc.2009.5346153","title":"Job batching and scheduling for parallel non-identical machines via MILP and Petri nets","display_name":"Job batching and scheduling for parallel non-identical machines via MILP and Petri nets","publication_year":2009,"publication_date":"2009-10-01","ids":{"openalex":"https://openalex.org/W2161593778","doi":"https://doi.org/10.1109/icsmc.2009.5346153","mag":"2161593778"},"language":"en","primary_location":{"id":"doi:10.1109/icsmc.2009.5346153","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsmc.2009.5346153","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Systems, Man and Cybernetics","raw_type":"proceedings-article"},"type":"article","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/A5054822123","display_name":"Ralf Frohlich","orcid":null},"institutions":[{"id":"https://openalex.org/I159176309","display_name":"Universit\u00e4t Hamburg","ror":"https://ror.org/00g30e956","country_code":"DE","type":"education","lineage":["https://openalex.org/I159176309"]},{"id":"https://openalex.org/I884043246","display_name":"Hamburg University of Technology","ror":"https://ror.org/04bs1pb34","country_code":"DE","type":"education","lineage":["https://openalex.org/I884043246"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Ralf Frohlich","raw_affiliation_strings":["Institute of Automation, Hamburg University of Technology, Hamburg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Automation, Hamburg University of Technology, Hamburg, Germany","institution_ids":["https://openalex.org/I159176309","https://openalex.org/I884043246"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084962404","display_name":"Matthias H\u00fcsig","orcid":null},"institutions":[{"id":"https://openalex.org/I159176309","display_name":"Universit\u00e4t Hamburg","ror":"https://ror.org/00g30e956","country_code":"DE","type":"education","lineage":["https://openalex.org/I159176309"]},{"id":"https://openalex.org/I884043246","display_name":"Hamburg University of Technology","ror":"https://ror.org/04bs1pb34","country_code":"DE","type":"education","lineage":["https://openalex.org/I884043246"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Matthias Husig","raw_affiliation_strings":["Institute of Automation, Hamburg University of Technology, Hamburg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Automation, Hamburg University of Technology, Hamburg, Germany","institution_ids":["https://openalex.org/I159176309","https://openalex.org/I884043246"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7571,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.79727155,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"3","issue":null,"first_page":"293","last_page":"298"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9997000098228455,"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.9997000098228455,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11741","display_name":"Flexible and Reconfigurable Manufacturing Systems","score":0.9919999837875366,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8014371395111084},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.66241055727005},{"id":"https://openalex.org/keywords/workload","display_name":"Workload","score":0.6497190594673157},{"id":"https://openalex.org/keywords/petri-net","display_name":"Petri net","score":0.5852365493774414},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5852189660072327},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5671023726463318},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.500314474105835},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.48619359731674194},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44148463010787964},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4194096624851227},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4127888083457947},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.40400606393814087},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24338331818580627},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.1280432939529419},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08071056008338928},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.068470299243927}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8014371395111084},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.66241055727005},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.6497190594673157},{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.5852365493774414},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5852189660072327},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5671023726463318},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.500314474105835},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.48619359731674194},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44148463010787964},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4194096624851227},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4127888083457947},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.40400606393814087},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24338331818580627},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.1280432939529419},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08071056008338928},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.068470299243927}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icsmc.2009.5346153","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icsmc.2009.5346153","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Systems, Man and Cybernetics","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5799999833106995,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W593069586","https://openalex.org/W1490850339","https://openalex.org/W1525321139","https://openalex.org/W2014763284","https://openalex.org/W2037625525","https://openalex.org/W2135424543","https://openalex.org/W2141637382","https://openalex.org/W2147504115","https://openalex.org/W2151966196","https://openalex.org/W2158475480","https://openalex.org/W2160283566","https://openalex.org/W2326490187","https://openalex.org/W4234582748"],"related_works":["https://openalex.org/W1551257573","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/W4232431455","https://openalex.org/W2386868101"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"two":[3],"modeling":[4],"approaches":[5],"for":[6],"batching":[7],"and":[8,26,124],"scheduling":[9,16],"jobs":[10,18,37],"on":[11,46,116],"parallel":[12],"non-identical":[13],"machines.":[14],"For":[15],"of":[17,35,51,85,91],"the":[19,36,47,52,82,86,89,92,96,109],"due":[20,93],"dates":[21],"as":[22,65],"a":[23,38,57,75,113],"hard":[24],"restriction":[25],"machine":[27,73],"dependent":[28],"processing":[29],"times":[30],"are":[31,122],"considered.":[32],"Between":[33],"each":[34],"setup":[39,50],"may":[40],"be":[41,63],"necessary":[42],"or":[43],"not,":[44],"depending":[45],"predecessor.":[48],"The":[49,77],"machines":[53,87],"is":[54,79],"done":[55],"by":[56],"single":[58],"worker":[59],"who":[60],"needs":[61],"to":[62,80,104],"scheduled":[64],"well,":[66],"since":[67],"only":[68],"he":[69],"can":[70],"serve":[71],"one":[72,111],"at":[74],"time.":[76],"objective":[78],"maximize":[81],"overall":[83],"workload":[84],"meeting":[88],"constraint":[90],"dates.":[94],"While":[95],"first":[97],"approach":[98],"uses":[99,112],"mixed":[100],"integer":[101],"linear":[102],"programming":[103],"calculate":[105],"an":[106],"optimal":[107],"schedule,":[108],"second":[110],"simulation,":[114],"based":[115],"colored":[117],"Petri":[118],"nets.":[119],"Both":[120],"methods":[121],"tested":[123],"evaluated":[125],"using":[126],"illustrative":[127],"simulation":[128],"examples.":[129]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}