{"id":"https://openalex.org/W2169167188","doi":"https://doi.org/10.1109/efta.2007.4416794","title":"A linear programming based heuristic for solving a two-stage flowshop scheduling problem","display_name":"A linear programming based heuristic for solving a two-stage flowshop scheduling problem","publication_year":2007,"publication_date":"2007-09-01","ids":{"openalex":"https://openalex.org/W2169167188","doi":"https://doi.org/10.1109/efta.2007.4416794","mag":"2169167188"},"language":"en","primary_location":{"id":"doi:10.1109/efta.2007.4416794","is_oa":false,"landing_page_url":"https://doi.org/10.1109/efta.2007.4416794","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE Conference on Emerging Technologies & Factory Automation (EFTA 2007)","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/A5022757608","display_name":"Ewa Figielska","orcid":"https://orcid.org/0000-0002-2158-3394"},"institutions":[{"id":"https://openalex.org/I4210112454","display_name":"Warsaw School of Computer Science","ror":"https://ror.org/0229g8886","country_code":"PL","type":"education","lineage":["https://openalex.org/I4210112454"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Ewa Figielska","raw_affiliation_strings":["Warsaw School of Computer Science, Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"Warsaw School of Computer Science, Warsaw, Poland","institution_ids":["https://openalex.org/I4210112454"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5022757608"],"corresponding_institution_ids":["https://openalex.org/I4210112454"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.20251337,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"31","issue":null,"first_page":"392","last_page":"397"},"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9980000257492065,"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.9907000064849854,"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/job-shop-scheduling","display_name":"Job shop scheduling","score":0.8492075800895691},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7304474115371704},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.646649181842804},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5748803019523621},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.561453640460968},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5087922215461731},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4541338384151459},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.43783992528915405},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28267282247543335},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22768157720565796},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.1591433584690094}],"concepts":[{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.8492075800895691},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7304474115371704},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.646649181842804},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5748803019523621},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.561453640460968},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5087922215461731},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4541338384151459},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.43783992528915405},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28267282247543335},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22768157720565796},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.1591433584690094},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/efta.2007.4416794","is_oa":false,"landing_page_url":"https://doi.org/10.1109/efta.2007.4416794","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE Conference on Emerging Technologies & Factory Automation (EFTA 2007)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1963747385","https://openalex.org/W1983412100","https://openalex.org/W1985116335","https://openalex.org/W1988424649","https://openalex.org/W2008663213","https://openalex.org/W2010643995","https://openalex.org/W2025873924","https://openalex.org/W2037201010","https://openalex.org/W2052542866","https://openalex.org/W2060435333","https://openalex.org/W2068471948","https://openalex.org/W2072283662","https://openalex.org/W2075167823","https://openalex.org/W2077522094","https://openalex.org/W2099854641","https://openalex.org/W2153144242","https://openalex.org/W4253777384"],"related_works":["https://openalex.org/W3172150420","https://openalex.org/W2107725657","https://openalex.org/W2112121444","https://openalex.org/W1974309933","https://openalex.org/W4213379045","https://openalex.org/W3204654320","https://openalex.org/W3190401582","https://openalex.org/W2789293570","https://openalex.org/W4205832532","https://openalex.org/W2074319831"],"abstract_inverted_index":{"This":[0],"paper":[1],"deals":[2],"with":[3,13,63],"the":[4,33,54,64,68,79],"problem":[5,38],"of":[6,27,35,53,73],"preemptive":[7],"scheduling":[8],"in":[9,88],"a":[10,74],"two-stage":[11],"flowshop":[12],"parallel":[14],"unrelated":[15],"machines":[16],"and":[17],"renewable":[18],"resources":[19],"at":[20],"each":[21],"stage.":[22],"The":[23,30,37,71],"resource":[24],"requirements":[25],"are":[26,46,82],"0-1":[28],"type.":[29],"objective":[31],"is":[32,39,57],"minimization":[34],"makespan.":[36,70],"NP-hard.":[40],"Heuristic":[41],"algorithms":[42,56,81],"using":[43],"linear":[44],"programming":[45],"proposed":[47,80],"for":[48],"solving":[49],"this":[50],"problem.":[51],"Performance":[52],"heuristic":[55,61],"analyzed":[58],"by":[59],"comparing":[60],"solutions":[62,87],"lower":[65],"bound":[66],"on":[67],"optimal":[69],"results":[72],"computational":[75],"experiment":[76],"show":[77],"that":[78],"able":[83],"to":[84],"produce":[85],"good":[86],"short":[89],"computation":[90],"time.":[91]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}