|
|
|
|
Optimal Two Stages Specially Structured Flow Shop Scheduling: Minimize the Rental Cost with Independent Setup Time
|
|
|
|
|
|
|
|
نویسنده
|
Gupta D ,Sharma S ,Bala S
|
|
منبع
|
international journal of applied operational research - 2012 - دوره : 2 - شماره : 3 - صفحه:31 -43
|
|
چکیده
|
One of the earliest results in flow shop scheduling theory is an algorithm given byjohnson’s [1] for scheduling jobs on two or three machines to minimize the total elapsed timewhenever the processing times of jobs are random. the present paper is an attempt to develop aheuristic algorithm for two stages specially structured flow shop scheduling in which the processingtimes of the jobs are not completely random, but bear a well defined relationship to one another tominimize the utilization time of machines and hence their rental cost under a specified rental policy.further the processing times and independent set up times, each are associated with probabilities. acomputer programme followed by a numerical illustration is given to validate the proposed algorithm.
|
|
کلیدواژه
|
Processing Time ,Set Up Time ,Specially Structured Flow Shop ,Makespan ,Utilization Time ,Rental Cost
|
|
آدرس
|
M.M.University, Mullana, Ambala, Haryana, Prof & Head Department of Mathematics, India, D.A.V. College, Jalandhar City, Punjab, Assistant Prof , Department of Mathematics, India, M.M.University, Mullana, Ambala, Haryana, Research Scholar, Department of Mathematics, India
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|