A Review on Complexity of Time Scheduling Problems and Methodology of its Model

Pages:154-156
S. K. Nayeem Pasha (Department of Mathematics, CMJ University, Shillong)

In this paper, we studied two production scheduling problems with sequence-dependent setups times. The setup times are one of the most common complications in scheduling problems, and are usually associated with cleaning operations and changing tools and shapes in machines.