Master of Science (MS)
“A biotechnology device manufacturer needs to devise effective scheduling algorithms for its testing devices. A device is a configuration of machines, each of which performs a specific task, such as washing, reading and cleaning. These devices are used to test human samples to diagnose diseases like cholera, malaria etc. Each test is a job, which is to be processed on these machines for a specific amount of time. Every job has its own pre defined sequence. These samples are to be processed simultaneously on machines owing to constraint that as soon as one machine completes processing a sample, it should be immediately processed by another machine. This constraint is significantly known as no- wait constraint. Given a set of jobs the web application assigns an optimal start time for each job owing to no-wait constraint. This results in reducing the overall time taken to process the jobs, which is formally known as makespan. The main objective of the project is to minimize the makespan. The application is specific to laboratory platform, which helps them to test the samples in optimal time. The heuristic, which I have implemented, is designed with future advancements in mind. The application can be extended to test different heuristic procedures by keeping the time tabling intact. The development environment to be used in this project will require Microsoft Visual Studio, C#, ASP.NET, and other real time chart tools like Microsoft Silverlight.”
Karnati, Shashidhar Reddy, "An approach to solve job shop scheduling problem" (2012). Master's Projects. 277.