A Combined Meta-Heuristic with Hyper-Heuristic Approach to Single Machine Production Scheduling Problem

This paper is concerned with minimization of mean tardiness and flow time in a real single machine production scheduling problem. Two variants of genetic algorithm as metaheuristic are combined with hyper-heuristic approach are proposed to solve this problem. These methods are used to solve instances generated with real world data from a company. Encouraging results are reported.

Production Scheduling Improvements in an Automotive Sector Company

The paper attempts to overcome the fluctuations occurring in demand of the components in an automotive sector company. Resource and time being the strict constraints, the production is not able to match the pace of the fluctuating demand. So, we introduce some production schedules that help in meeting out the required demand. The merits and demerits of the approaches are also highlighted.

A Multi-Objective Optimization Model to the Integrating Flexible Process Planning And Scheduling Based on Modified Particle Swarm Optimization Algorithm (MPSO)

Process planning and production scheduling play important roles in manufacturing systems. In this paper a multiobjective mixed integer linear programming model is presented for the integrated planning and scheduling of multi-product. The aim is to find a set of high-quality trade-off solutions. This is a combinatorial optimization problem with substantially large solution space, suggesting that it is highly difficult to find the best solutions with the exact search method. To account for it, a PSO-based algorithm is proposed by fully utilizing the capability of the exploration search and fast convergence. To fit the continuous PSO in the discrete modeled problem, a solution representation is used in the algorithm. The numerical experiments have been performed to demonstrate the effectiveness of the proposed algorithm.

Modeling and Optimization of Aggregate Production Planning - A Genetic Algorithm Approach

The Aggregate Production Plan (APP) is a schedule of the organization-s overall operations over a planning horizon to satisfy demand while minimizing costs. It is the baseline for any further planning and formulating the master production scheduling, resources, capacity and raw material planning. This paper presents a methodology to model the Aggregate Production Planning problem, which is combinatorial in nature, when optimized with Genetic Algorithms. This is done considering a multitude of constraints of contradictory nature and the optimization criterion – overall cost, made up of costs with production, work force, inventory, and subcontracting. A case study of substantial size, used to develop the model, is presented, along with the genetic operators.

Collaboration of Multi-Agent and Hyper-Heuristics Systems for Production Scheduling Problem

This paper introduces a framework based on the collaboration of multi agent and hyper-heuristics to find a solution of the real single machine production problem. There are many techniques used to solve this problem. Each of it has its own advantages and disadvantages. By the collaboration of multi agent system and hyper-heuristics, we can get more optimal solution. The hyper-heuristics approach operates on a search space of heuristics rather than directly on a search space of solutions. The proposed framework consists of some agents, i.e. problem agent, trainer agent, algorithm agent (GPHH, GAHH, and SAHH), optimizer agent, and solver agent. Some low level heuristics used in this paper are MRT, SPT, LPT, EDD, LDD, and MON

Minimizing Makespan Subject to Budget Limitation in Parallel Flow Shop

One of the criteria in production scheduling is Make Span, minimizing this criteria causes more efficiently use of the resources specially machinery and manpower. By assigning some budget to some of the operations the operation time of these activities reduces and affects the total completion time of all the operations (Make Span). In this paper this issue is practiced in parallel flow shops. At first we convert parallel flow shop to a network model and by using a linear programming approach it is identified in order to minimize make span (the completion time of the network) which activities (operations) are better to absorb the predetermined and limited budget. Minimizing the total completion time of all the activities in the network is equivalent to minimizing make span in production scheduling.

Design Considerations of Scheduling Systems Suitable for PCB Manufacturing

This paper identifies five key design characteristics of production scheduling software systems in printed circuit board (PCB) manufacturing. The authors consider that, in addition to an effective scheduling engine, a scheduling system should be able to process a preventative maintenance calendar, to give the user the flexibility to handle data using a variety of electronic sources, to run simulations to support decision-making, and to have simple and customisable graphical user interfaces. These design considerations were the result of a review of academic literature, the evaluation of commercial applications and a compilation of requirements of a PCB manufacturer. It was found that, from those systems that were evaluated, those that effectively addressed all five characteristics outlined in this paper were the most robust of all and could be used in PCB manufacturing.