Job Shop Scheduling Using Modified Simulated Annealing Algorithm

Abstract

 Timely and cost factor is increasingly important in today’s global competitive market. The key problem faced by today’s industries are feasible allocation of various jobs to available resources i.e., machines (Scheduling) and optimal utilization of the available resources. Among the various problems in scheduling, the job shop scheduling is the most complicated and requires a large computational effort to solve it. A typical job shop scheduling problem has a set of jobs to be processed in a set of machines, with certain constraints and objective function to be achieved. The most commonly considered objectives are the minimization of make span, minimization of tardiness which leads to minimization of penalty cost, and to maximize machine utilization. Machine shop scheduling can be done using various techniques like standard dispatching rules, heuristic techniques like Simulated annealing, Tabu Search, Genetic algorithm, etc,.here a typical job shop shop scheduling problem is solved using simulated annealing(SA) technique, a heuristic search algorithm. SA is generic neighbourhood search algorithm used to locate optimal solution very nearer to global optimal solution. A software based program is developed in VB platform for a typical job shop problem and test instances were performed over it. Experimental results obtained were further tuned by varying parameters and optimal results were obtained

Authors and Affiliations

PV Senthiil*,

Keywords

Related Articles

 EMBEDDED TRAFFIC CONTROL SYSTEM USING VANET

 This paper deals with designing an embedded traffic control system (TFC) using wireless ad hoc sensor and VANET. In this paper we discuss the details regarding the information about how the ad hoc sensors are...

 FIVE POLE OPTIMUM DISTRIBUTED HIGH PASS MICROWAVE FILTER: DESIGN ANALYSIS AND SIMULATION ON MICROSTRIP AT 2.4 GHZ

 This paper presents a frequency responsive design of an optimum distributed high pass filter having a cutoff frequency fc = 2.4 GHz and a 0.1 dB ripple passband up to 10.4 GHz with Z0 = 50 ohm. This presents a...

 SMART BUS MONITORING AND TRACKING SYSTEM

 Primary information for the most citytransport travelers the bus arrival time. Excessively there often discourages the travelers due to long waiting time at busstops and for taking busesmakes them reluctant. In th...

 REVIEW PAPER: ANALYSIS OF DATA TRANSFORMATION IN RAPID PROTOTYPING TECHNOLOGY

 Layered manufacturing (LM) machines use stereolithography (STL) files to build parts by creating continuous slices on top of each other. An STL file approximates the surface of a part with planar triangles. This r...

 Deconstructing Evolutionary Programming

 The theory approach to e-business is defined not the essential need for thin clients. Here, we confirm the exploration theoretic theory, which we call Pud.

Download PDF file
  • EP ID EP122330
  • DOI -
  • Views 70
  • Downloads 0

How To Cite

PV Senthiil*, (30).  Job Shop Scheduling Using Modified Simulated Annealing Algorithm. International Journal of Engineering Sciences & Research Technology, 3(9), 54-60. https://europub.co.uk/articles/-A-122330