Certain investigations on job scheduling in due date sequence dependent family and data gathering network problems

Abstract

Scheduling problems are common phenomena in everyday life. Ordering of jobs or tasks to satisfy constraints determine a schedule. Scheduling is a part and parcel of Optimization techniques. The objective of this research is to propose suitable optimization techniques for the following range of problems and solve the problems using the suitable algorithms, a) Due Date Problem b) Sequence Dependent Family Setup Time Problem c) Data Gathering Network Problem. In Due Date Problem optimal schedule is created so as to minimize the earliness and tardiness penalties. In sequence dependent family setup time problem different approaches are considered which minimizes the maximum penalty. Data Gathering Network Problem is solved in two stages. In the first stage a technique is proposed to find the potential list of nodes which should compress their packet. In the second stage, a schedule is created. Schedule facilitates the system, time at which the node should send its packet. Dynamic analysis to set idle time of jobs on a single machine problem considered here is to find the optimal schedule so as to minimize the earliness and tardiness penalties from a given due date di. This thesis proposes a technique to insert the idle time. The penalty, through the insertion of the idle time, is minimized on its own up to the point where no further minimization of the objective function is achieved. newline newline newline