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 …

In this review paper, recent developments in robotic problems are cited. A robotic
manufacturing system includes at least a robot-as a material handling device-, a co-worker …

This paper investigates a dynamic scheduling problem within a job shop robotic cell,
wherein multiple robotic arms are responsible for material handling in a U-shaped …

We address a robotic flow shop scheduling problem where two part types are processed on
each given set of dedicated machines. A single robot moving on a fixed rail transports one …

Many modern manufacturing settings feature especially close relationship of the
transportation of workpieces between production steps with the scheduling of manufacturing …

The robotic job-shop scheduling problem (RJSP) has become increasingly important due to
the wide application of robots for material delivery in modern logistics and supply chain …

The flexible job shop scheduling problem (FJSP) is a difficult discrete combinatorial
optimization problem, which has been widely studied due to its theoretical and practical …

Nowadays, with the advancement of technological innovations and wide implementation of
modern mining equipment, research topics on mining equipment management are attracting …

Through new technologies development, customers can make or cancel an order at any
time, which disrupts the established production schedule. This reality forced many …

Production planning optimization remains a major challenge in almost all industries,
particularly in high-tech manufacturing. A critical task to support such optimization is …