Meet ApplyKite Twin, the application assistant that learns with you

Meet your Twin, it learns with you

Your Twin learns with you

Launch week codes:30% off annual Pro20% off monthly Pro

Ends in00h00m00s

Janis S. Neufeld

Professor

Otto-von-Guericke Universität Magdeburg

Germany

Research Interests

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Explore related searches

Professors in Germany

About

Janis S. Neufeld is a Professor at Otto-von-Guericke University Magdeburg, Germany. His research focuses on operational research, particularly in scheduling problems, including flow shop scheduling, railway operations, and customer order scheduling in manufacturing contexts. Recent publications highlight innovative algorithms and multi-objective approaches aimed at enhancing efficiency and addressing transportation challenges in scheduling.

Articles (16)

Year:

2026

Year:

2026

Year:

2026

Year:

2026

Year:

2025

Year:

2025

Year:

2025

Year:

2025

Year:

2024

Year:

2024

Year:

2023

Year:

2023

Year:

2022

Year:

2022

Year:

2022

Year:

2022

Collaborators (4)

Mike Hewitt

Associate Professor

Loyola University Chicago

UNITED STATES

View details

Jatinder N. D. Gupta

University of Alabama in Huntsville

UNITED STATES

View details

Jan Fabian Ehmke

Full Professor

Universität Wien

AUSTRIA

View details

Fatih Kocatürk

Universität Wien

AUSTRIA

View details

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Janis S. Neufeld

Research Interests

Make your next move.

Explore related searches

About

Articles (16)

Local search methods for the cumulative flow shop scheduling problem

Multi-objective optimization with order acceptance for the cumulative job shop scheduling problem in agribusiness

The rolling stock circulation planning problem: a tutorial with case study

Towards holistic environmental awareness in distributed permutation flowshop scheduling: Integrating production and transportation emissions

The distributed flow shop scheduling problem with inter-factory transportation

Challenges and the Need to Integrate Rolling Stock and Crew Scheduling for Efficient Railway Operations

Customer order scheduling in a permutation flow shop environment

Order Acceptance and Scheduling in Capacitated Job Shops

Historical information based iterated greedy algorithm for distributed flowshop group scheduling problem with sequence-dependent setup times

Minimizing the earliness–tardiness for the customer order scheduling problem in a dedicated machine environment

An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem

An iterated local search for customer order scheduling in additive manufacturing

Multi-objective carbon-efficient scheduling in distributed permutation flow shops under consideration of transportation efforts

A systematic review of multi-objective hybrid flow shop scheduling

Corrigendum to: “Solving the flexible job shop scheduling problem with sequence-dependent setup times”, [European Journal of Operational Research 265, 503–516, 2018]

Iterated greedy algorithms for customer order scheduling with dedicated machines

Collaborators (4)

Mike Hewitt

Jatinder N. D. Gupta

Jan Fabian Ehmke

Fatih Kocatürk

Make your next move.