default search action
Udo Buscher
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j30]Eduardo A. Alarcón Gerbier
, Udo Buscher
The dynamic facility location problem with mobile production units: A waste recycling application. Comput. Oper. Res. 166: 106609 (2024) - [j29]Benedikt Zipfel
An iterated local search for customer order scheduling in additive manufacturing. Int. J. Prod. Res. 62(3): 605-625 (2024) - [j28]Julius Hoffmann, Janis S. Neufeld, Udo Buscher:
Minimizing the earliness-tardiness for the customer order scheduling problem in a dedicated machine environment. J. Sched. 27(6): 525-543 (2024) - 2023
- [j27]Felix Tamke
The vehicle routing problem with drones and drone speed selection. Comput. Oper. Res. 152: 106112 (2023) - [j26]Janis S. Neufeld
A systematic review of multi-objective hybrid flow shop scheduling. Eur. J. Oper. Res. 309(1): 1-23 (2023) - [c11]Paul Päprer
A Bi-Objective Column Generation Approach for Real-World Rolling Stock Circulation Planning Problems. ICCL 2023: 350-364 - 2022
- [j25]Eduardo A. Alarcón Gerbier
Modular and mobile facility location problems: A systematic review. Comput. Ind. Eng. 173: 108734 (2022) - [c10]Steffen Rudert, Udo Buscher
Heuristics for the Single-Item Dynamic Lot-Sizing Problem with Rework of Internal Returns. ICCL 2022: 425-440 - 2021
- [j24]Junwen Ding
Energy aware scheduling in flexible flow shops with hybrid particle swarm optimization. Comput. Oper. Res. 125: 105088 (2021) - [j23]Janis S. Neufeld
An efficient column generation approach for practical railway crew scheduling with attendance rates. Eur. J. Oper. Res. 293(3): 1113-1130 (2021) - [c9]Martin Scheffler, Lisa Wesselink, Udo Buscher
A Multi-periodic Modelling Approach for Integrated Warehouse Design and Product Allocation. ICCL 2021: 178-191 - [c8]Benedikt Zipfel, Janis S. Neufeld
Customer Order Scheduling in an Additive Manufacturing Environment. APMS (4) 2021: 101-109 - [c7]Franz Ehm
Classifying Ready-for-Transfer Patients in the Intensive Care Unit Based on Clinical Data. OR 2021: 209-215 - [i1]Felix Tamke
The vehicle routing problem with drones and drone speed selection. CoRR abs/2111.13050 (2021) - 2020
- [j22]Julia Heil, Kirsten Hoffmann, Udo Buscher
Railway crew scheduling: Models, methods and applications. Eur. J. Oper. Res. 283(2): 405-425 (2020) - [j21]Janis S. Neufeld
Scheduling flowline manufacturing cells with inter-cellular moves: non-permutation schedules and material flows in the cell scheduling problem. Int. J. Prod. Res. 58(21): 6568-6584 (2020) - [c6]Eduardo A. Alarcón Gerbier
Minimizing Movements in Location Problems with Mobile Recycling Units. ICCL 2020: 396-411 - [e1]Janis S. Neufeld
Operations Research Proceedings 2019, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Dresden, Germany, September 4-6, 2019. Springer 2020, ISBN 978-3-030-48438-5 [contents]
2010 – 2019
- 2019
- [j20]Kirsten Hoffmann, Udo Buscher
Valid inequalities for the arc flow formulation of the railway crew scheduling problem with attendance rates. Comput. Ind. Eng. 127: 1143-1152 (2019) - [c5]Janis S. Neufeld
Capacitated Lot Sizing for Plastic Blanks in Automotive Manufacturing Integrating Real-World Requirements. OR 2019: 539-544 - 2018
- [j19]Ina Bräuer, Udo Buscher
A note on 'Pricing and ordering decisions in a supply chain with imperfect quality items and inspection under buyback of defective items'. Int. J. Prod. Res. 56(15): 5272-5277 (2018) - 2017
- [j18]Kirsten Hoffmann, Udo Buscher
Solving Practical Railway Crew Scheduling Problems with Attendance Rates. Bus. Inf. Syst. Eng. 59(3): 147-159 (2017) - [j17]Armin Klausnitzer, Janis S. Neufeld
Scheduling dynamic job shop manufacturing cells with family setup times: a simulation study. Logist. Res. 10(1): 4 (2017) - [c4]Laura Manzke, Birgit Keller, Udo Buscher
An Artificial Bee Colony Algorithm to Solve the Single Row Layout Problem with Clearances. ISAT (3) 2017: 285-294 - 2016
- [j16]Gerhard Aust, Udo Buscher
Game theoretic analysis of pricing and vertical cooperative advertising of a retailer-duopoly with a common manufacturer. Central Eur. J. Oper. Res. 24(1): 127-147 (2016) - [j15]Janis Sebastian Neufeld
A comprehensive review of flowshop group scheduling literature. Comput. Oper. Res. 70: 56-74 (2016) - 2015
- [j14]Birgit Keller, Udo Buscher
Single row layout models. Eur. J. Oper. Res. 245(3): 629-644 (2015) - 2014
- [j13]Gerhard Aust, Udo Buscher
Vertical cooperative advertising in a retailer duopoly. Comput. Ind. Eng. 72: 247-254 (2014) - [j12]Hongyun Xu, Zhipeng Lü, Aihua Yin, Liji Shen, Udo Buscher
A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times. Comput. Oper. Res. 50: 47-60 (2014) - [j11]Gerhard Aust, Udo Buscher
Cooperative advertising models in supply chain management: A review. Eur. J. Oper. Res. 234(1): 1-14 (2014) - [j10]Gerhard Aust, Ina Bräuer, Udo Buscher
A note on "Quality investment and inspection policy in a supplier-manufacturer supply chain". Eur. J. Oper. Res. 234(3): 910-915 (2014) - [j9]Liji Shen, Jatinder N. D. Gupta
Flow shop batching and scheduling with sequence-dependent setup times. J. Sched. 17(4): 353-370 (2014) - [j8]Liji Shen, Lars Mönch, Udo Buscher
A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups. J. Sched. 17(5): 471-487 (2014) - 2013
- [j7]Liji Shen, Lars Mönch, Udo Buscher
An iterative approach for the serial batching problem with parallel machines and job families. Ann. Oper. Res. 206(1): 425-448 (2013) - [c3]Richard Hinze, Dirk Sackmann, Udo Buscher
A Contribution to the Reentrant Flow-Shop Scheduling Problem. MIM 2013: 718-723 - 2012
- [j6]Liji Shen, Udo Buscher
Solving the serial batching problem in job shop manufacturing systems. Eur. J. Oper. Res. 221(1): 14-26 (2012) - [j5]Gerhard Aust, Udo Buscher
Vertical cooperative advertising and pricing decisions in a manufacturer-retailer supply chain: A game-theoretic approach. Eur. J. Oper. Res. 223(2): 473-482 (2012) - [c2]Udo Buscher, Birgit Mayer, Tobias Ehrig:
A Genetic Algorithm for the Unequal Area Facility Layout Problem. OR 2012: 109-114 - 2010
- [j4]Udo Buscher
MIP formulations and heuristics for solving parallel batching problems. J. Syst. Sci. Complex. 23(5): 884-895 (2010)
2000 – 2009
- 2009
- [j3]Udo Buscher
An integrated tabu search algorithm for the lot streaming problem in job shops. Eur. J. Oper. Res. 199(2): 385-399 (2009) - 2007
- [j2]Udo Buscher
Optimizing a production system with rework and equal sized batch shipments. Comput. Oper. Res. 34(2): 515-535 (2007) - 2004
- [j1]Udo Buscher
Ensuring feasibility in 'a generalized quantity discount pricing model to increase supplier's profits'. J. Oper. Res. Soc. 55(6): 667-670 (2004) - 2002
- [c1]Udo Buscher, Gerd Lindner:
Determination of Economic Production Quantity for a Multi-Stage Production System with Limited Storage Capacity. OR 2002: 89-94
Coauthor Index
aka: Janis Sebastian Neufeld
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-12-10 20:51 CET 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: