A semiconductor final testing scheduling problem with multiresource constraints is
considered in this paper, which is proved to be NP-hard. To minimize the makespan for this …

Semiconductor final testing scheduling problem (SFTSP) has extensively been studied in
advanced manufacturing and intelligent scheduling fields. This paper presents a Q-learning …

In this paper, a novel fruit fly optimization algorithm (nFOA) is proposed to solve the
semiconductor final testing scheduling problem (SFTSP). First, a new encoding scheme is …

In this paper, we address a semiconductor final testing problem from the semiconductor
manufacturing process. We aim to determine both the assignment of machines and the …

The job shop scheduling problem (JSSP) is a popular NP-hard scheduling problem that
simulates the scheduling problems of different real-world applications in fields such as …

The optimization-based scheduling algorithms used for scheduling workflows in cloud
computing environments may easily get trapped in local optima, especially in the beginning …

Scheduling of complex manufacturing systems entails complicated constraints such as the
mating operational one. Focusing on the real settings, this article considers an extended …

Reinforcement learning (RL) has emerged as a promising approach for scheduling
semiconductor operations. Yet, it is still challenging to solve large-scale scheduling …

Task scheduling in the cloud platform seems to be the most significant issue to guarantee
that cloud connectivity adequately and efficiently meets the requirements of customers …

Uncertainty in semiconductor fabrication facilities (fabs) requires scheduling methods to
attain quick real-time responses. They should be well tuned to track the changes of a …