This study investigates the quality inspection and optimal decision-making in production processes using a dynamic programming algorithm. The primary objective is to develop a sampling inspection plan ...

In Branch and Bound, upper bounds are typically obtained by constructing feasible solutions using greedy algorithms, heuristic methods, or rounding relaxed solutions like Linear Programming results.

Deterministic processing time are no longer applicable under realistic circumstances because of the uncertainties involved in manufacturing and production processes. The present study aims to address ...