Process scheduling by output considerations

In multi-tasking systems when it is not possible to guarantee completion of all activities by specified times, the scheduling problem is not straightforward. Examples of this situation in real-time programming include the occurrence of alarm conditions and the buffering of output to peripherals in on-line facilities. The latter case is studied here with the hope of indicating one solution to the general problem.

Scheduling forest road maintenance using the analytic hierarchy process and heuristics

Abstract

Strategies to model scheduling decisions to plan the soft drink production process

In this paper we present a mixed integer model that integrates lot sizing and lot scheduling decisions for the production planning of a soft drink company. The main contribution of the paper is to present a model that differ from others in the literature for the constraints related to the scheduling decisions. The proposed strategy is compared to other strategies presented in the literature.

Production planning and optimization of a pulp mill: introduction of the optimisation based scheduling software for pulp industry

The objective of this project was to introduce a new software product to pulp industry, a new market for case company. An optimization based scheduling tool has been developed to allow pulp operations to better control their production processes and improve both production efficiency and stability. Both the work here and earlier research indicates that there is a potential for savings around 1-5%. All the supporting data is available today coming from distributed control systems, data historians and other existing sources. The pulp mill model together with the scheduler, allows what-if analyses of the impacts and timely feasibility of various external actions such as planned maintenance of any particular mill operation. The visibility gained from the model proves also to be a real benefit. The aim is to satisfy demand and gain extra profit, while achieving the required customer service level. Research effort has been put both in understanding the minimum features needed to satisfy the scheduling requirements in the industry and the overall existence of the market. A qualitative study was constructed to both identify competitive situation and the requirements vs. gaps on the market. It becomes clear that there is no such system on the marketplace today and also that there is room to improve target market overall process efficiency through such planning tool. This thesis also provides better overall understanding of the different processes in this particular industry for the case company.

A novel approach for distributed application scheduling based on prediction of communication events

The evolution of commodity computing lead to the possibility of efficient usage of interconnected machines to solve computationally-intensive tasks, which were previously solvable only by using expensive supercomputers. This, however, required new methods for process scheduling and distribution, considering the network latency, communication cost, heterogeneous environments and distributed computing constraints. An efficient distribution of processes over such environments requires an adequate scheduling strategy, as the cost of inefficient process allocation is unacceptably high. Therefore, a knowledge and prediction of application behavior is essential to perform effective scheduling. In this paper, we overview the evolution of scheduling approaches, focusing on distributed environments. We also evaluate the current approaches for process behavior extraction and prediction, aiming at selecting an adequate technique for online prediction of application execution. Based on this evaluation, we propose a novel model for application behavior prediction, considering chaotic properties of such behavior and the automatic detection of critical execution points. The proposed model is applied and evaluated for process scheduling in cluster and grid computing environments. The obtained results demonstrate that prediction of the process behavior is essential for efficient scheduling in large-scale and heterogeneous distributed environments, outperforming conventional scheduling policies by a factor of 10, and even more in some cases. Furthermore, the proposed approach proves to be efficient for online predictions due to its low computational cost and good precision. (C) 2009 Elsevier B.V. All rights reserved.

Prediction of dynamical, nonlinear, and unstable process behavior

Process scheduling techniques consider the current load situation to allocate computing resources. Those techniques make approximations such as the average of communication, processing, and memory access to improve the process scheduling, although processes may present different behaviors during their whole execution. They may start with high communication requirements and later just processing. By discovering how processes behave over time, we believe it is possible to improve the resource allocation. This has motivated this paper which adopts chaos theory concepts and nonlinear prediction techniques in order to model and predict process behavior. Results confirm the radial basis function technique which presents good predictions and also low processing demands show what is essential in a real distributed environment.

A continuous-time MILP model for short-term scheduling of make-and-pack production processes

In process industries, make-and-pack production is used to produce food and beverages, chemicals, and metal products, among others. This type of production process allows the fabrication of a wide range of products in relatively small amounts using the same equipment. In this article, we consider a real-world production process (cf. Honkomp et al. 2000. The curse of reality – why process scheduling optimization problems are diffcult in practice. Computers & Chemical Engineering, 24, 323–328.) comprising sequence-dependent changeover times, multipurpose storage units with limited capacities, quarantine times, batch splitting, partial equipment connectivity, and transfer times. The planning problem consists of computing a production schedule such that a given demand of packed products is fulfilled, all technological constraints are satisfied, and the production makespan is minimised. None of the models in the literature covers all of the technological constraints that occur in such make-and-pack production processes. To close this gap, we develop an efficient mixed-integer linear programming model that is based on a continuous time domain and general-precedence variables. We propose novel types of symmetry-breaking constraints and a preprocessing procedure to improve the model performance. In an experimental analysis, we show that small- and moderate-sized instances can be solved to optimality within short CPU times.

Pientalon asiakaskeskeisenLVI-teknisen laatusuunnittelujärjestelmän kehittäminen

Tämä opinnäytetyö on tehty SkinnAir Oy:lle, ja se käsittelee pientalojen LVI-teknistä suunnittelua pienen suunnitteluyrityksen näkökulmasta. Nykyinen kiivas rakentamistyyli, kasvaneet asumisviihtyvyydenvaatimukset, asennusammattilaisten puute sekä jatkuvasti kohoavat vaatimukset rakennusten energiatehokkuuden parantamiseksi vaativat yhä parempia ja laadukkaampia suunnitelmia pientalojen LVI-teknisten ratkaisujen toteuttamiseksi. Suunnittelusta saatavan heikon tuottavuuden johdosta monet suunnittelutoimistot eivät ole kiinnostuneita pientalojen LVI-suunnittelusta. Tässä työssä pyritään etsimään niitä menetelmiä, joilla erityisesti pieni suunnitteluyritys kykenee parantamaankannattavuuttaan ja nostamaan palvelun laatua kyseisellä suunnittelun osa-alueella. Työ on toteutettu perehtymällä yksityiskohtaisesti suunnitteluprosessin eri vaiheisiin sekä analysoimalla näistä vaiheista saadut tulokset Työssä tunnistetaan erilaiset asiakastyypit sekä heidän tarpeensa. Asiakastarpeiden perusteellasaadaan määritettyä oikeat lähtötiedot kohteen LVI-suunnittelua varten. Työn keskeinen osa on suunnitteluprosessin etenemisen sekä suunnittelutyöhön kuuluvien tehtävien tarkastelu. Tämän tarkastelun avulla pyritään löytämään keinot, joillakyetään tehostamaan suunnitteluprosessin eri vaiheisiin liittyviä toimintoja, parantamaan palvelun laatua sekä lisäksi minimoimaan suunnitteluprosessin aikaisia kustannuksia yrityksen kannattavuuden parantamiseksi. LVI-suunnittelutyön eteneminen painottuu asiakas- ja lähtötietojen keräämiseen sekä eri välivaiheiden hyväksyttämiseen tilaajalla. Suunnittelutyöhön vaikuttavat tekijät saadaan selville jatkuvassa, ennalta hyvin aikataulutetussa asiakaskontaktissa. Asiakkaan huomioiminen suunnitteluprosessin eri vaiheissa parantaa kokonaisvaltaista asiakaspalvelua. Näin asiakkaan saama vastine rahoilleen kasvaa. Suunnittelijan kannalta turhat muutostyöt vähenevät, koska asiakas on selvillä suunnittelutyön etenemisestä. Johtopäätöksenä voidaan todeta, että hyvän suunnitteluprosessin edellytyksenä on yksityiskohtaisten lähdetietojen käyttö. Työn tuloksena ilmeni, että valmiiden, ennalta hyvin laadittujen lomakkeiden käyttäminen parantaa selkeästi suunnittelutyön tehokkuutta. Lopputuloksena syntyi jatkokehittelyä vaativa lomakepohja asiakastarpeisiin perustuvalle lähtötietolomakkeelle. Lisäksi yrityksen käyttöön on tarkoitus laatia tarvittavat tietokannat sekä valmiit asennuspiirrokset. Lopullinen tavoite on rakentaa tässä työssä kuvatuista menetelmistä kattava tietotekninen järjestelmä parantamaan sekä yrityksen kannattavuutta että suunnittelutyön laatua. Lisäksi voidaan todeta, että rakennettava järjestelmä mahdollistaa myös vaativan suunnittelutyön tuotteistamisen.

Optimal scheduling of aircrafts’ engines repair process

We address a real world scheduling problem concerning the repair process of aircrafts’ engines by TAP - Maintenance & Engineering (TAP-ME). TAP-ME is the maintenance, repair and overhaul organization of TAP Portugal, Portugal’s leading airline, which employs about 4000 persons to provide maintenance and engineering services in aircraft, engines and components. TAP-ME is aiming to optimize its maintenance services, focusing on the reduction of the engines repair turnaround time.

Scheduling aircraft’s engines repair process: a mathematical model

In this talk, we discuss a scheduling problem that originated at TAP - Maintenance & Engineering - the maintenance, repair and overhaul organization of Portugal’s leading airline. In the repair process of aircrafts’ engines, the operations to be scheduled may be executed on a certain workstation by any processor of a given set, and the objective is to minimize the total weighted tardiness. A mixed integer linear programming formulation, based on the flexible job shop scheduling, is presented here, along with computational experiment on a real instance, provided by TAP-ME, from a regular working week. The model was also tested using benchmarking instances available in literature.

Three time-based scale formulations for the two-stage lot sizing and scheduling in process industries

In this paper, we propose three novel mathematical models for the two-stage lot-sizing and scheduling problems present in many process industries. The problem shares a continuous or quasi-continuous production feature upstream and a discrete manufacturing feature downstream, which must be synchronized. Different time-based scale representations are discussed. The first formulation encompasses a discrete-time representation. The second one is a hybrid continuous-discrete model. The last formulation is based on a continuous-time model representation. Computational tests with state-of-the-art MIP solver show that the discrete-time representation provides better feasible solutions in short running time. On the other hand, the hybrid model achieves better solutions for longer computational times and was able to prove optimality more often. The continuous-type model is the most flexible of the three for incorporating additional operational requirements, at a cost of having the worst computational performance. Journal of the Operational Research Society (2012) 63, 1613-1630. doi:10.1057/jors.2011.159 published online 7 March 2012

Advanced production scheduling for batch plants in process industries

An Advanced Planning System (APS) offers support at all planning levels along the supply chain while observing limited resources. We consider an APS for process industries (e.g. chemical and pharmaceutical industries) consisting of the modules network design (for long–term decisions), supply network planning (for medium–term decisions), and detailed production scheduling (for short–term decisions). For each module, we outline the decision problem, discuss the specifi cs of process industries, and review state–of–the–art solution approaches. For the module detailed production scheduling, a new solution approach is proposed in the case of batch production, which can solve much larger practical problems than the methods known thus far. The new approach decomposes detailed production scheduling for batch production into batching and batch scheduling. The batching problem converts the primary requirements for products into individual batches, where the work load is to be minimized. We formulate the batching problem as a nonlinear mixed–integer program and transform it into a linear mixed–binary program of moderate size, which can be solved by standard software. The batch scheduling problem allocates the batches to scarce resources such as processing units, workers, and intermediate storage facilities, where some regular objective function like the makespan is to be minimized. The batch scheduling problem is modelled as a resource–constrained project scheduling problem, which can be solved by an efficient truncated branch–and–bound algorithm developed recently. The performance of the new solution procedures for batching and batch scheduling is demonstrated by solving several instances of a case study from process industries.