A Multistage Metaheuristic Scheduling Algorithm in LCD Module Lines Composed of Processes
نویسندگان
چکیده
منابع مشابه
Hybrid Metaheuristic Algorithm for Job Scheduling on Computational Grids
The dynamic nature of grid resources and the demands of users produce complexity in the grid scheduling problem that cannot be addressed by deterministic algorithms with polynomial complexity. One of the best methods for grid scheduling is the genetic algorithm (GA); the simple and parallel features of this algorithm make it applicable to several optimization problems. A GA searches the problem...
متن کاملA note on module-composed graphs
In this paper we consider module-composed graphs, i.e. graphs which can be defined by a sequence of single vertex insertions v1, . . . , vn, such that the neighbourhood of vertex vi, 2 ≤ i ≤ n, forms a module (a homogenous set) of the graph defined by vertices v1, . . . , vi−1. Module composed graphs are HHDS-free and thus homogeneous orderable, weakly chordal, and perfect. Every bipartite dist...
متن کاملAn enhanced decomposition algorithm for multistage stochastic hydroelectric scheduling
Handling uncertainty in natural inflow is an important part of a hydroelectric scheduling model. In a stochastic programming formulation, natural inflow may be modeled as a random vector with known distribution, but the size of the resulting mathematical program can be formidable. Decomposition-based algorithms take advantage of special structure and provide an attractive approach to such probl...
متن کاملHMHS: Hybrid Multistage Heuristic Scheduling Algorithm for Heterogeneous MapReduce System
The scale of data in a MapReduce system is increasing quickly. Thus how to efficiently schedule a set of production jobs has become increasingly important. For a given set of jobs, a well-designed scheduling algorithm can significantly reduce makespan and increase the utilization of clusters. However, there exists very few studies that aim to construct a scheduler that minimizes the makespan of...
متن کامل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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Korean Institute of Industrial Engineers
سال: 2012
ISSN: 1225-0988
DOI: 10.7232/jkiie.2012.38.4.262