BATCH COMPUTtR SCHEDULING: A HtURISTICALLY MOTIVATED APPROACH 7. AUTMOHfO
نویسنده
چکیده
Efficient echeduling of Jobs for computer systems Is a problam of continuing concern. The applicability of scheduling methodology described in the operations research literature Is severely restricted by tha dimensionality of job characteristics, the number of c.istinct resource types comprising a computer system, the non-datorministic nature of the system due to both interprocess interaction and contention, and the existence of a multitude of constraints effecting job initiation times, job completion times, and job interactions. In view of the largo number of issues which must be considered in job scheHuling, a heuristiapproach seems appropriate. This paper describes an initial inrplfimer^ation of such an approach based upon a fast, analytically driven, pedormance prediction tool.
منابع مشابه
Scheduling Job Shops with Batch Machines Using the Lagrangian Relaxation Technique
Scheduling is a key factor for manufacturing productivity. Effective scheduling can improve on-time delivery, reduce work-in-process inventory, cut lead time, and improve machine utilization. Motivated by the extensive use of batch machines in manufacturing industries, the scheduling of job shops with batch machines is studied in this paper. Unlike machines that can process one part at a time (...
متن کاملHeuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
This research is motivated by a scheduling problem found in the di6usion and oxidation areas of semiconductor wafer fabrication, where the machines can be modeled as parallel batch processors. We attempt to minimize total weighted tardiness on parallel batch machines with incompatible job families and unequal ready times of the jobs. Given that the problem is NP-hard, we propose two di6erent de...
متن کاملEfficient Algorithms for Just-In-Time Scheduling on a Batch Processing Machine
Just-in-time scheduling problem on a single batch processing machine is investigated in this research. Batch processing machines can process more than one job simultaneously and are widely used in semi-conductor industries. Due to the requirements of just-in-time strategy, minimization of total earliness and tardiness penalties is considered as the criterion. It is an acceptable criterion for b...
متن کاملFuzzy Programming for Parallel Machines Scheduling: Minimizing Weighted Tardiness/Earliness and Flow Time through Genetic Algorithm
Appropriate scheduling and sequencing of tasks on machines is one of the basic and significant problems that a shop or a factory manager encounters; this is why in recent decades extensive studies have been done on scheduling issues. One type of scheduling problems is just-in-time (JIT) scheduling and in this area, motivated by JIT manufacturing, this study investigates a mathematical model for...
متن کاملRole of batch size in scheduling optimization of flexible manufacturing system using genetic algorithm
Flexible manufacturing system (FMS) readily addresses the dynamic needs of the customers in terms of variety and quality. At present, there is a need to produce a wide range of quality products in limited time span. On-time delivery of customers’ orders is critical in make-to-order (MTO) manufacturing systems. The completion time of the orders depends on several factors including arrival rate, ...
متن کامل