A GENETIC ALGORITHM FOR JOB SHOP SCHEDULING PROBLEM IN AGILE MANUFACTURING SYSTEM
Keywords:
Agile manufacturing system, Job shop scheduling problem, Genetic Algorithm (GA)Abstract
The new challenges of Agile Manufacturing system led to study of computational cooperative problem solving models. The goal is to develop appropriate computational approaches to support adaptive, cost-effective responsiveness. In particular, the challenging problem of job shop scheduling, this has been one of the primary foci of production scheduling research. In this paper, we propose genetic algorithm to overcome the impact of agile environment such as changing customers’ preferences, machine breakdowns, deadlocks, etc. by inserting the slack that can absorb these disruptions without affecting the other scheduled activities. The proposed algorithm also focuses on the impact of agility in the job shop environment in such highly complex scenarios. The algorithm inherits the delicacies of Genetic Algorithm (GA) converges towards optimality in less computational time. The proposed model encompasses the objectives of minimizing the delay time and flow time using the genetic algorithm.
Downloads
References
Blazewicz J Dror M and Weglarz J (1991), “Mathematical programming formulations for machine scheduling: a survey”, European Journal of Operational Research, Vol. 51, 283- 300.
Brah S A and Hunsucker J L (1991), “Branch and bound algorithm for the flow shop with multiple processors”, European Journal of Operational Research, Vol. 51, 88 -99.
Brah S A Hunsucker J L and Shah J R (1991), “Mathematical modeling of scheduling problems”, Journal of Information and Optimization Sciences, Vol. 12, 113 - 137.
Chen B (1995), “Analysis of classes of heuristics for scheduling a two-stage flow shops with parallel machines at one stage”, Journal of Operational Research Society, Vol. 46, 234 - 244.
Cheng T C E and Sin C C S (1990), “A state-of-the-art review of parallel-machine scheduling research”, European Journal of Operational Research, Vol. 47, 271 - 292.
Goffman E G Garey M R and Johnson D S (1978), “An application of bin-packing to multiprocessor scheduling”, SIAM Journal of Computing, Vol. 7, 1 - 17.
Gonzalez T and Sahni S (1978), “Flowshop and jobshop schedules: complexity and approximation”, Operations Research, Vol. 26, 36 - 52.
Gupta J N D (1988), “Two-stage hybrid flow shop scheduling problem”, Journal of Operational Research Society, Vol. 34, 359 - 364.
Gupta J N D and Tunc E A (1991), “Schedules for a two-stage hybrid flow shop with parallel machines at the second stage”, International Journal of Production Research, Vol. 29, 1489 - 1502.
Hunsucker J L and Shah J R (1994), “Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment”, European Journal of Operational Research, Vol. 72, 102 - 114.
Johnson S M (1954), “Optimal two and three-stage production schedule with setup times included”, Naval Research Logistics Quarterly, Vol.1, 61- 68.
Kusiak A (1989), “Aggregate scheduling of a flexible machining and assembly system”, IEEE Transactions on Robotics and Automation, Vol. 5, 451 - 459.
Lee C Y Cheng T C E and Lin B M T (1993), “Minimizing the make span in the 3- machine assembly-type flow shop scheduling problem”, Management Science, Vol. 39, 616 - 625.
Lee C Y and Vairaktarakis G L (1998), “Performance comparison of some classes of flexible flow shops and job shops”, International Journal of Flexible Manufacturing Systems, Vol. 10, 379 - 405.
Srikandarajah C and Sethi S P (1989), “Scheduling algorithms for flexible flow shop: worst and average case performance”, European Journal of Operational Research, Vol. 43, 143 - 160.
