Folgen
Janis Sebastian Neufeld
Janis Sebastian Neufeld
Chair of Industrial Management, TU Dresden
Bestätigte E-Mail-Adresse bei tu-dresden.de - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Solving the flexible job shop scheduling problem with sequence-dependent setup times
L Shen, S Dauzère-Pérès, JS Neufeld
European journal of operational research 265 (2), 503-516, 2018
2192018
A comprehensive review of flowshop group scheduling literature
JS Neufeld, JND Gupta, U Buscher
Computers & Operations Research 70, 56–74, 2016
1152016
A multi-objective iterated local search algorithm for comprehensive energy-aware hybrid flow shop scheduling
S Schulz, JS Neufeld, U Buscher
Journal of Cleaner Production 224, 421-434, 2019
852019
Solving practical railway crew scheduling problems with attendance rates
K Hoffmann, U Buscher, JS Neufeld, F Tamke
Business & Information Systems Engineering 59 (3), 147-159, 2017
322017
A constructive algorithm and a simulated annealing approach for solving flowshop problems with missing operations
M Henneberg, JS Neufeld
International Journal of Production Research 54 (12), 3534-3550, 2016
322016
Minimising makespan in flowshop group scheduling with sequence-dependent family set-up times using inserted idle times
JS Neufeld, JND Gupta, U Buscher
International Journal of Production Research 53 (6), 1791-1806, 2015
282015
Prognostic Model Development with Missing Labels: A Condition-Based Maintenance Approach Using Machine Learning
P Zschech, K Heinrich, R Bink, JS Neufeld
Business & Information Systems Engineering 61 (3), 327–343, 2019
222019
A systematic review of multi-objective hybrid flow shop scheduling
JS Neufeld, S Schulz, U Buscher
European Journal of Operational Research 309 (1), 1-23, 2023
192023
Multi-objective carbon-efficient scheduling in distributed permutation flow shops under consideration of transportation efforts
S Schulz, M Schönheit, JS Neufeld
Journal of Cleaner Production 365, 132551, 2022
182022
Scheduling flowline manufacturing cells with inter-cellular moves: non-permutation schedules and material flows in the cell scheduling problem
JS Neufeld, FF Teucher, U Buscher
International Journal of Production Research, 2-17, 2019
162019
An MIP-based heuristic solution approach for the locomotive assignment problem focussing on (dis-)connecting processes
M Scheffler, JS Neufeld, M Hölscher
Transportation Research Part B: Methodological 139, 64-80, 2020
152020
An Efficient Column Generation Approach for Practical Railway Crew Scheduling with Attendance Rates
JS Neufeld, M Scheffler, F Tamke, K Hoffmann, U Buscher
European Journal of Operational Research, 2021
142021
Customer order scheduling in an additive manufacturing environment
B Zipfel, JS Neufeld, U Buscher
Advances in Production Management Systems. Artificial Intelligence for …, 2021
72021
Scheduling dynamic job shop manufacturing cells with family setup times: a simulation study
A Klausnitzer, JS Neufeld, U Buscher
Logistics Research 4, 1-18, 2017
72017
An iterated local search for customer order scheduling in additive manufacturing
B Zipfel, J Neufeld, U Buscher
International Journal of Production Research, 1-21, 2023
42023
Efficient railway crew scheduling in german regional passenger transport
JS Neufeld
Impact 2019 (2), 7-10, 2019
42019
An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem
X He, QK Pan, L Gao, JS Neufeld
European Journal of Operational Research 310 (2), 597-610, 2023
22023
Daily Distribution of Duties for Crew Scheduling with Attendance Rates: A Case Study
M Scheffler, JS Neufeld
Lalla-Ruiz E., Mes M., Voß S. (eds) Computational Logistics. ICCL 2020 …, 2020
22020
Operations Research Proceedings 2019
JS Neufeld, J Schönberger, U Buscher, R Lasch, D Möst
Annual International Conference of the German Operations Research Society …, 2020
1*2020
An Improved LP-Based Heuristic for Solving a Real-World Locomotive Assignment Problem
M Scheffler, M Hölscher, JS Neufeld
Logistics Management: Strategies and Instruments for digitalizing and …, 2019
12019
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20