Heuristic techniques for solving Job shop scheduling problem

Abstract

In the modern competitive environment in manufacturing and newlineservice industries the effective sequencing and scheduling have become newlineessential for continuous existence in the marketplace Companies have to newlineproduce their product untimely as opposed to due date Otherwise it will newlineinterrupt upon reputation of a business At the same time the activities and newlineoperations need to be scheduled with the intention that the available resources newlinewill be used in an Efficient manner Scheduling is an intellectual and skilled newlineprocess of finding the optimal resources for processing of different activities newlineThe main goal of a good schedule is to overcome heterogeneous computing newlineResources minimize overall performance such as high resource utilization rate newlineand to support various computing intensive applications involving batch jobs newlineand parallel activities The resources are wisely chosen based on their newlineavailability and capacity Main challenges are faced in scheduling of tasks to newlinethe best available resources To attain an effectual and operative scheduling newlineeffective new algorithms are essential Researchers have done many newlineexperiments on scheduling and created great good scheduling algorithms newline newline