default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRainer Leisten
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j13]Jose M. Framiñan
, Rainer Leisten:
Linking Scheduling Criteria to Shop Floor Performance in Permutation Flowshops. Algorithms 12(12): 263 (2019)- 2016
- [j12]Victor Fernandez-Viagas, Rainer Leisten, Jose M. Framiñan:
A computational evaluation of constructive and improvement heuristics for the blocking flow shop to minimise total flowtime. Expert Syst. Appl. 61: 290-301 (2016) - 2015
- [j11]Rainer Leisten, Chandrasekharan Rajendran:
Variability of completion time differences in permutation flow shop scheduling. Comput. Oper. Res. 54: 155-167 (2015) - 2014
- [b1]Jose M. Framiñan, Rainer Leisten, Rubén Ruiz García:
Manufacturing Scheduling Systems - An Integrated View on Models, Methods and Tools. Springer 2014, ISBN 978-1-4471-6271-1, pp. I-XVIII, 1-400 - 2010
- [j10]Imma Ribas, Rainer Leisten, Jose M. Framiñan:
Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. Comput. Oper. Res. 37(8): 1439-1454 (2010)
2000 – 2009
- 2008
- [j9]Jose M. Framiñan, Rainer Leisten:
A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria. OR Spectr. 30(4): 787-804 (2008) - 2005
- [j8]Jose M. Framiñan, Rainer Leisten, Rafael Ruiz-Usano:
Comparison of heuristics for flowtime minimisation in permutation flowshops. Comput. Oper. Res. 32: 1237-1254 (2005) - [j7]Rainer Leisten, Pascal Reusch:
Mechanisms for Coordination of Master Planning and lot sizing within a Hierarchical production Planning Model. Int. J. Comput. 4(3): 117-123 (2005) - [j6]Jose M. Framiñan, Jatinder N. D. Gupta, Rainer Leisten:
A review and classification of heuristics for permutation flow-stop scheduling with makespan objective. J. Oper. Res. Soc. 56(3): 351 (2005) - 2004
- [j5]Jose M. Framiñan, Jatinder N. D. Gupta, Rainer Leisten:
A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. J. Oper. Res. Soc. 55(12): 1243-1255 (2004) - 2002
- [j4]Jose M. Framiñan, Rainer Leisten, Rafael Ruiz-Usano:
Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation. Eur. J. Oper. Res. 141(3): 559-569 (2002) - [c1]Arnd-D. zur Horst, Rainer Leisten:
Innovationscontrolling in Supply Networks. Modelle im E-Business 2002: 273-288
1990 – 1999
- 1999
- [j3]Kurt Jørnsten, Rainer Leisten, Sverre Storøy:
Convergence aspects of adaptive clustering in variable aggregation. Comput. Oper. Res. 26(10-11): 955-966 (1999) - 1998
- [j2]Rainer Leisten:
An LP-aggregation view on aggregationin multi-level production planning. Ann. Oper. Res. 82: 233-250 (1998) - 1997
- [j1]Rainer Leisten:
A posteriori error bounds in linear programming aggregation. Comput. Oper. Res. 24(1): 1-16 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-23 21:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
