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 …

The flexible job shop scheduling problem (FJSP) is an NP-hard combinatorial optimization
problem, which has wide applications in the real world. The complexity and relevance of the …

As an important branch of production scheduling, flexible job-shop scheduling problem
(FJSP) is difficult to solve and is proven to be NP-hard. Many intelligent algorithms have …

This study investigates the optimization of non-permutation flow-shop scheduling problems
and lot-sizing simultaneously. Contrary to previous works, we first study the energy …

Pallet automation system (PAS) has gained more and more attention from many
manufacturing enterprises with the development of flexible automation, where machine …

With the rapid development of smart manufacturing, data-driven fault diagnosis has attracted
increasing attentions. As one of the most popular methods applied in fault diagnosis, deep …

There is a lack of research on the flexible job shop scheduling problem (FJSP) considering
limited fixture-pallet resources in multi-product mixed manufacturing workshops. However …

Traditional job shop scheduling is concentrated on centralized scheduling or semi-
distributed scheduling. Under the Industry 4.0, the scheduling should deal with a smart and …

Individualized manufacturing implies high flexibility of both the hardware and software of the
production lines based on a fast physical and logical system (de) commissioning. This paper …

Job shop scheduling always plays an important role in the manufacturing process and is
one of the decisive factors influencing manufacturing efficiency. In the actual process of …