Author:
Goel Richa,Gupta Deepak,Kaur Harshleen
Abstract
Abstract
This paper studies scheduling problem of two machines with uncertain dispensation time. Our objective of study is to attain a schedule which makes idle time of machines equal to zero and reduces the rental cost of machines. Here processing time is uncertain. To deal with uncertainty Ginni Simpson Index is used. A numerical example is employed to make clear the given algorithm.
Reference14 articles.
1. Optimal two-and three-stage production schedules with setup times included;Johnson;Naval Research Logistics (NRL). Mar 1,1954
2. A general algorithm for solution of the n-job, M-machine sequencing problem of the flow shop;Smith;Operations Research. Feb,1967
3. Flow shop no-idle or no-wait scheduling to minimize the sum of completion times;Adiri;Naval Research Logistics,1982
4. Minimize total elapsed time subject to zero idle time of machines in n *3 flow shop problem;Narain;Indian journal of Pure and Applied Mathematics,2003
5. Optimal three stage production schedule, the processing and set up times associated with probabilities including job block criteria;Singh,2005