Job shop scheduling problem (JSSP) is a thriving area of scheduling research, which has
been concerned and studied widely by scholars in engineering and academic fields. This …

Jaya algorithm (JAYA) is a new metaheuristic algorithm, which has a very simple structure
and only requires population size and terminal condition for optimization. Given the two …

This paper addresses a distributed lot-streaming permutation flow shop scheduling problem
that has various applications in real-life manufacturing systems. We aim to optimally assign …

Abstract Integrated Process Planning and Scheduling (IPPS) problem is an urgent problem
to be solved in manufacturing system. In green manufacturing mode, there are also some …

Due to the complementarity of the process planning and shop scheduling, their integration
can greatly facilitate the development of the intelligent manufacturing system. In the last …

The distributed flexible job shop scheduling problem (DFJSP), which is an extension of the
flexible job shop scheduling problem, is a famous NP-complete combinatorial optimization …

The integration of process planning and job shop scheduling is of great significance to
improve the performance of manufacturing system. Many studies on integrating process …

This work proposes a multi-surrogate-assisted optimisation and performance investigation of
several newly developed metaheuristics (MHs) for the optimisation of vehicle …

This paper investigates a flexible job shop scheduling problem with uncertain processing
time. The uncertainty of the processing time is characterized by a generalized grey number …

The permutation flow shop scheduling problem (PFSP) is one of the most important
scheduling types in the mass customization production with many real-world applications. It …