Genetic algorithm for large-size multi-stage batch plant scheduling
نویسندگان
چکیده
منابع مشابه
Genetic Algorithm for Large-Size Multi-Stage Batch Plant Scheduling
This paper presents a heuristic approach based on genetic algorithm (GA) for solving large-size multi-stage multi-product scheduling problem (MMSP) in batch plant. The proposed approach is suitable for different scheduling objectives, such as total process time, total flow time, etc. In the algorithm, solutions to the problem are represented by chromosomes that will be evolved by GA. A chromoso...
متن کاملA Genetic Based Scheduling Algorithm for the PHSP with Unequal Batch Size Inbound Trailers
This paper considers the parcel hub scheduling problem (PHSP) with unequal batch size inbound trailers, which is a combinatorial optimization problem commonly found in a parcel consolidation terminal in the parcel delivery industry (PDI). The problem consists of processing a large number of inbound trailers at a much smaller number of unload docks. The parcels in the inbound trailers must be un...
متن کامل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, ...
متن کاملA MILP Scheduling Model for Multi-stage Batch Plants
Abstract In the current work, a new precedence-based mixed integer linear programming (MILP) scheduling framework, based on a continuous-time representation, is developed for the scheduling in multi-stage batch plants. Advantages and special features of the proposed scheduling model are highlighted through several instances of two base case studies. Results are analyzed and further criticized t...
متن کاملEffective Decomposition Algorithm for Multistage Batch Plant Scheduling
Abstract This paper presents a new algorithm for the scheduling of batch plants with a large number of orders and sequence-dependent changeovers. Such problems are either intractable or yield poor solutions with full-space approaches. We use decomposition on the entire set of orders and derive the complete schedule in several iterations. The key idea is to allow for partial rescheduling without...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chemical Engineering Science
سال: 2007
ISSN: 0009-2509
DOI: 10.1016/j.ces.2006.11.049