Shefali Aggarwal

A fuzzy logic-based approach for multistage flowshop scheduling with arbitrary lags and transportation time

The aim of this paper is to introduce the concept of arbitrary lags in n-jobs, m machines flowshop scheduling problem involving the processing times and transportation times of jobs. Start lag is the minimum time which must elapse between starting of job i on the first machine and starting of job i on the last machine. The stop lag for the job i is the minimum time which must elapse between completing job i on the first machine and completing it on the last machine. The concept of fuzzy processing time to represent the uncertainty, vagueness in processing of jobs is introduced. An algorithm to find the optimal sequence so as to minimise the total elapsed time subject to some specified lag time constraint is discussed. A numerical illustration is given to demonstrate the computational efficiency of proposed algorithm as a valuable analytical tool for the researchers.

Three stage constrained flow shop scheduling with jobs in a string of disjoint job-block

The objective of this paper is to develop a heuristic algorithm to minimize the total elapsed time for n jobs, 3 machine flow shop production scheduling in which processing times and independent set up times, each associated with probabilities including transportation time and breakdown interval. Further the jobs are processed in a string of disjoint job blocks. A computer programme followed by a numerical illustration is given to substantiate the algorithm.

A Mathematical Approach for Three Stage Flow Shop Production Schedule with Jobs in a String of Disjoint Job Block

The aim of this paper is to introduce the concept of disjoint job blocks in n-jobs, three machines flow shop scheduling problem to minimize the total elapsed time and rental cost of the machines under a specified rental policy in which the processing time associated with probabilities including transportation time. A heuristic approach for flow shop with a computational algorithm to find optimal or near optimal solution is described. A computer program followed by a numerical illustration is given to justify the proposed algorithm.