Heuristic Approach for Bicriteria in Constrained Three Stage Flow Shop Scheduling

This paper presents bicriteria 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, independent setup time each associated with probabilities including transportation time and job block concept. Further the concept of the break down interval for which the machines are not available for the processing is included. A heuristic approach method to find optimal or near optimal sequence has been discussed. A computer programme followed by a numerical illustration is given to substantiate the algorithm. Keywords: Flow Shop, Processing time, Setup time, Makespan, Break-down interval, Job block, Transportation time, Rental Cost

Bicriteria in n x 3 Flow Shop Scheduling under Specified Rental Policy, Processing Time Associated with Probabilities including Transportation Time and Job Block Criteria

This paper deals with bicriteria in n-jobs, 3-machines flowshop scheduling problem in which the processing times are associated with probabilities including transportation time and job block criteria. The objective of the study is to obtain an optimal solution for minimizing the bicriteria taken as minimizing the total rental cost of the machines subject to obtains the minimum makespan. A heuristic approach method to find optimal or near optimal sequence has been discussed. A computer programme followed by a numerical illustration is give to clarify the algorithm. Keywords: Flowshop Scheduling, Heuristic, Processing Time, Transportation Time, Rental Cost, Idle Time, Job block, Makespa

Bicriteria in n x 3 Flow Shop Scheduling Under Specified Rental Policy, Processing Time Associated with Probabilities including Transportation Time and Job Block Criteria

This paper deals with bicriteria in n-jobs, 3-machines flowshop scheduling problem in which the processing times are associated with probabilities including transportation time and job block criteria. The objective of the study is to obtain an optimal solution for minimizing the bicriteria taken as minimizing the total rental cost of the machines subject to obtains the minimum makespan. A heuristic approach method to find optimal or near optimal sequence has been discussed. A computer programme followed by a numerical illustration is give to clarify the algorithm. Keywords: Flowshop Scheduling, Heuristic, Processing Time, Transportation Time, Rental Cost, Idle Time, Job block, Makespa

Bicriteria in Constrained n x 3 Flow Shop to Minimize the Rental Cost, Setup Time, Processing Time Each Associated with Probabilities Including Transportation Time and Job Block Criteria

This paper is an attempt to obtain an optimal solution for minimizing the bicriteria taken as minimizing the total rental cost of the machines subject to obtain the minimum makespan for  constrained n jobs 3 machines flowshop scheduling problem in which the processing times, independent set up times each associated with probabilities including transportation time and job block concept. The two criteria of minimizing the maximum utilization of the machines or rental cost of machines and minimizing the maximum makespan are one of the combinations of our objective function reflecting the performance measure. The proposed method is very simple and easy to understand. A computer programme followed by a numerical illustration is given to clarify the algorithm. Keywords: Flowshop Scheduling, Heuristic, Processing Time, Set Up Time, Transportation Time, Rental Cost , Job Block