Problem Sequencing and Scheduling of Heuristic and Development of Delivery and Step Up Time

Pages:170-171
A. Srinivasa Swamy (Department of Mathematics, CMJ University, Shillong)

In present era competitive markets, the importance of good scheduling strategies in manufacturing companies lead to the need of developing efficient methods to solve complex scheduling problems. In Mathematics first problem considered is a single-machine scheduling with release dates, sequence dependent setup times and delivery times and the performance measure is the maximum lateness. The second problem is a job-shop scheduling problem with sequence-dependent setup times where the objective is to minimize the makespan.[1]