Job shop scheduling (JSS) problems consist of a set of machines and a collection of jobs to be scheduled.
Each job consists of several operations with specified processing order. In this paper, Job Shop Model problem is scheduled by using Genetic Algorithm (GA), Simulated Annealing (SA) and Hybrid Simulated Annealing (HSA). Those three are considered as different treatments of each problem and are compared with the objective measure of number of tardy jobs in a job shop environment. The conclusion is that the performance measure Number of tardy jobs is minimum in the most of the cases under Genetic Algorithm when compared with other two algorithms.
ChenC.L.VempatiV.S.AljaberN.1995Theory and methodology: An application of Genetic Algorithms for flow shop problemsEuropean Journal of Operational Research (80), pp. 389–396.
3.
DominicPDD.KaliyamoorthyS.MuruganR., (2004), A conflict-based priority dispatching rule and operation-based approaches to job shops. International journal of Advanced Manufacturing Technology, (24) pp. 76–80.
4.
DornorfU.PeschE. (1993) Combining Genetic and Local Search for solving the job shop scheduling problem. APMOD93 Proceedings, Budabest: pp. 142–149.
5.
MontgomeryDouglas C., (1991). Design and analysis of experiments, John Wiley & sons, inc., second edition.
6.
FrenchS., (1982). Sequencing and Scheduling, New York: Halsted Press.
7.
GifflerB.ThompsonG.L., (1960). Algorithms for solving production scheduling problems, International Journal of Operations Research, No. (8), pp 487–503.
8.
GravesS. (1981). A review of production scheduling, Operations Research, No, 29: pp. 646–675.
9.
HauptR., (1989). A survey of priority rule based schedulingOperations Research Spektrum, 11 pp 3–16.
10.
HolthausO.ZieglerH., (1997). Improving job shop performance by coordinating dispatching rules, International Journal of Production Research, 35(2) pp. 539–549.
11.
KennethR. Baker, (1984). Sequencing rules and due-date assignments in a job shop, Management Science, 30(9) pp: 1093–1103.
12.
HolthausOliverRajendranChandrasekharan, (1997). Efficient dispatching rules for scheduling in a job shop, International Journal of Production Economics, 48, pp:87–105.
13.
PonnambalamS.G.JawaharN.AravindanP. (1999). A simulated annealing algorithm for job shop scheduling, Production Planning and Control, 10, pp. 767–777.
14.
SinghK.BochynekR. (1997). Comparison of heuristic search methods for sequencing problems A computational study, Proceedings of the first international conference on operations and quantitative management, Jan. 5–8, Jaipur (India): pp. 451–458.
15.
SridharJ.RajendranC. (1996). A Genetic Algorithm for family and Job Scheduling in a Flow line based manufacturing cell” Proceedings of 16th International Conference on Computers and Industrial Engineering, March 7–9, pp. 337–340.
