Follow
Janis Sebastian Neufeld
Janis Sebastian Neufeld
Chair of Industrial Management, TU Dresden
Verified email at tu-dresden.de - Homepage
Title
Cited by
Cited by
Year
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
2332018
A comprehensive review of flowshop group scheduling literature
JS Neufeld, JND Gupta, U Buscher
Computers & Operations Research 70, 56–74, 2016
1192016
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
1002019
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
372016
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
362017
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
342023
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
242019
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
202022
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
192019
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
182021
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
162020
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
82023
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
82017
Historical information based iterated greedy algorithm for distributed flowshop group scheduling problem with sequence-independent setup times
X He, QK Pan, L Gao, JS Neufeld, JND Gupta
Omega, 102997, 2023
72023
Customer order scheduling in an additive manufacturing environment
B Zipfel, JS Neufeld, U Buscher
Advances in Production Management Systems. Artificial Intelligence for …, 2021
72021
An iterated local search for customer order scheduling in additive manufacturing
B Zipfel, J Neufeld, U Buscher
International Journal of Production Research 62 (3), 605-625, 2024
62024
Efficient railway crew scheduling in german regional passenger transport
JS Neufeld
Impact 2019 (2), 7-10, 2019
52019
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
Iterated greedy algorithms for customer order scheduling with dedicated machines
J Hoffmann, JS Neufeld, U Buscher
IFAC-PapersOnLine 55 (10), 1594-1599, 2022
12022
The system can't perform the operation now. Try again later.
Articles 1–20