In this paper, we propose an Intelligent Decision Support System (IDSS) that combines prediction and optimization for production planning. We worked with a company provides software the garments Industry had access to real-world data related client works subcontractors. Using Automated Machine Learning (AutoML) approach, firstly target four predictive tasks are crucial estimate planning indicat...

Abstract In this article, we extend the generalized invexity and duality results for multiobjective variational problems with fractional derivative pertaining to an exponential kernel by using concept of weak minima. Multiobjective find their applications in economic planning, flight control design, industrial process control, space structures, production inventory, advertising investment, impu...

PT Millenia Tata Aria adalah satu dari banyaknya perusahaan di indonesia yang bergerak pada industri furniture & interiors dengan jenis produksi berdasarkan pesanan ( make to order ). Penelitian ini berfokus proses perakitan sofa produk bench. Permasalahan utama terdapat rancangan tata letak lantai dimana fasilllitas diletakkan berjauhan dan tidak memperhatikan tingkat kedekatan antar sehin...

The bin-packing problem (BPP) and its multi-dimensional variants have many practical applications, such as packing objects in boxes, production planning, multiprocessor scheduling, etc. The classical singleobjective formulation of the two-dimensional bin packing (2D-BPP) consists of packing a set of objects (pieces) in the minimum number of bins (containers). This paper presents a new Pareto-ba...

Cellular manufacturing (CM) is a production approach directed towards reducing costs, as well as increasing system’s flexibility in today’s small-to-medium lot production environment.Many structural and operational issues should be considered for a successful CM design and implementation such as cell formation (CF), production planning, and facility layout. Most researchers have addressed these...

Finding a minimum-weight spanning tree (MST) in a graph is a classic problem in operational research with important applications in network design. In this paper, we consider the degree-constrained multi-objective MST problem, which is NP-hard. On fteen benchmark instances, we compare the performance of three diierent algorithms: the Pareto archived evolution strategy (PAES); a new multiobjecti...