首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
In this paper we address the problem of planning a temporary storage area in a real production system. This temporary storage area is composed of parallel temporary storage units with distinct capacities. The storage operation of a job, also called a batch, has to answer time restrictions such as release dates, due dates, restricted family dependent setup times and time lags, and also a space constraint which is the capacity of the temporary storage unit. The goal is to schedule the batches on the storage units in order to minimize the total setup times and the maximum lateness. First, we model the problem on a single storage unit as a two-machine flowshop problem with a limited buffer capacity and we show that it is NP-hard. We also show that the particular case in which no lateness is allowed is solvable in polynomial time under special conditions on the buffer capacity, both for single or parallel temporary storage units. Next we provide three heuristics: a greedy algorithm, a hybrid heuristic based on Ant Colony Optimization and Simulated Annealing and finally a dedicated heuristic. The latter strongly exploits the structural properties shown in this paper. We provide experimental results which highlight the efficiency of the dedicated heuristic in comparison with the two other heuristics.  相似文献   

2.
Without Lipschitz condition, only the second order polynomial-like iterative equation was discussed for monotone usc multivalued solutions under the assumption that the coefficient of the first order iterate is large. In this paper without this assumption we give a general construction of infinitely many increasing usc multivalued solutions for multivalued iterative equation of order n.  相似文献   

3.
The aim of this paper is to formulate a model that integrates production planning and order acceptance decisions while taking into account demand uncertainty and capturing the effects of congestion. Orders/customers are classified into classes based on their marginal revenue and their level of variability in order quantity (demand variance). The proposed integrated model provides the flexibility to decide on the fraction of demand to be satisfied from each customer class, giving the planner the choice of selecting among the highly profitable yet risky orders or less profitable but possibly more stable orders. Furthermore, when the production stage exceeds a critical utilization level, it suffers the consequences of congestion via elongated lead-times which results in backorders and erodes the firm’s revenue. Through order acceptance decisions, the planner can maintain a reasonable level of utilization and hence avoid increasing delays in production lead times. A robust optimization (RO) approach is adapted to model demand uncertainty and non-linear clearing functions characterize the relationship between throughput and workload to reflect the effects of congestion on production lead times. Illustrative simulation and numerical experiments show characteristics of the integrated model, the effects of congestion and variability, and the value of integrating production planning and order acceptance decisions.  相似文献   

4.
《Optimization》2012,61(2):137-150
An algorithm for addressing multiple objective linear programming (MOLP) problems is presented. The algorithm modifies the path-following primal-dual algorithm to MOLP problems by using the single objective algorithm to generate interior search directions and later combine them to derive a single direction along which to step to the next iterate. Combining the different interior search directions is done by interacting with a Decision Maker (DM) to obtain locally-relevant preference information for the value vectors along these directions. This preference information is then used to derive an approximation to the gradient of an implicity-known utility function, and using a projection of this gradient provides a direction gradient of an implicitly-known utility function, and using a projection of this gradient provides a direction vector along which we step to the next iterate. At each iteration the algorithm also generates boundary points that aid in deriving the combined search direction. We refer to these boundary points, generated sequentially during the process, as anchor points that serve as candidate solutions at which to terminate the iterative process.  相似文献   

5.
This paper presents a mixed integer programming (MIP) model which succeeds in a system integration of the production planning and shop floor scheduling problems. The proposed advanced planning and scheduling (APS) model explicitly considers capacity constraints, operation sequences, lead times and due dates in a multi-order environment. The objective of the model is to seek the minimum cost of both production idle time and tardiness or earliness penalty of an order. The output of the model is operation schedules with order starting time and finish time. Numerical result shows that the suggested APS model can favorably produce optimal schedules.  相似文献   

6.
In this paper, we consider an inexact Newton method applied to a second order non‐linear problem with higher order non‐linearities. We provide conditions under which the method has a mesh‐independent rate of convergence. To do this, we are required, first, to set up the problem on a scale of Hilbert spaces and second, to devise a special iterative technique which converges in a higher than first order Sobolev norm. We show that the linear (Jacobian) system solved in Newton's method can be replaced with one iterative step provided that the initial non‐linear iterate is accurate enough. The closeness criteria can be taken independent of the mesh size. Finally, the results of numerical experiments are given to support the theory. Published in 2005 by John Wiley & Sons, Ltd.  相似文献   

7.
Lead times impact the performance of the supply chain significantly. Although there is a large literature concerning queuing models for the analysis of the relationship between capacity utilization and lead times, and there is a substantial literature concerning control and order release policies that take lead times into consideration, there have been only few papers describing models at the aggregate planning level that recognize the relationship between the planned utilization of capacity and lead times. In this paper we provide an in-depth discussion of the state-of-the art in this literature, with particular attention to those models that are appropriate at the aggregate planning level. Received: September 2005 / Revised version: November 2005 AMS classification: 46N10 All correspondence to: Stefan Vo?  相似文献   

8.
Production planning with load dependent lead times: an update of research   总被引:1,自引:0,他引:1  
Lead times impact the performance of the supply chain significantly. Although there is a large body of literature concerning queuing models for the analysis of the relationship between capacity utilization and lead times, and another body of work on control and order release policies that take lead times into consideration, there have been relatively few aggregate planning models that recognize the (nonlinear) relationship between the planned utilization of capacity and lead times. In this paper we provide an in-depth discussion of the state-of-the art in this area, with particular attention to those models that are appropriate at the aggregate planning level. An earlier version of this paper appeared in 4OR 3, 257–302, 2005.  相似文献   

9.
The problem of maximizing the entropy subject to simple constraint sets is reformulated as a structured variational inequality problem by introducing dual variables. A new iterative alternating direction method is then developed that generates alternatively the dual and primal iterates. For some existing maximum entropy problems in the literature, the new dual iterate can be derived from a simple projection and then the new primal iterate can be obtained via solving approximately n separate one-dimensional strong monotone equations. Therefore, the proposed method is very easy to carry out. Preliminary numerical results show that the method is applicable.  相似文献   

10.
A methodology to manage manufacturing lead times is currently being developed by the authors. The system is specifically designed to address the needs of small- to medium-sized make-to-order companies. It involves a hierarchical production planning system in which integration between the production and marketing functions is facilitated. Considerations of capacity are included at both of the decision levels addressed—the customer enquiry stage and the job release stage. This paper describes the job release stage, showing how it is linked with the higher-level stage by controlling a hierarchy of backlog lengths. At the job release stage the released backlog length for each work centre is maintained between predetermined minimum and maximum levels. It is shown that shop floor throughput times—an important part of manufacturing lead times—can be controlled by controlling released backlog lengths. The releasing mechanism is described and it is argued that there can be many benefits of job release—including reduced shop congestion, lower work-in-progress and lower costs.  相似文献   

11.
Parameters in mathematical models for glioblastoma multiforme (GBM) tumour growth are highly patient specific. Here, we aim to estimate parameters in a Cahn–Hilliard type diffuse interface model in an optimised way using model order reduction (MOR) based on proper orthogonal decomposition (POD). Based on snapshots derived from finite element simulations for the full-order model (FOM), we use POD for dimension reduction and solve the parameter estimation for the reduced-order model (ROM). Neuroimaging data are used to define the highly inhomogeneous diffusion tensors as well as to define a target functional in a patient-specific manner. The ROM heavily relies on the discrete empirical interpolation method, which has to be appropriately adapted in order to deal with the highly nonlinear and degenerate parabolic partial differential equations. A feature of the approach is that we iterate between full order solvers with new parameters to compute a POD basis function and sensitivity-based parameter estimation for the ROM problems. The algorithm is applied using neuroimaging data for two clinical test cases, and we can demonstrate that the reduced-order approach drastically decreases the computational effort.  相似文献   

12.
This paper examines the flow synchronization problem between a manufacturing location and multiple destinations. Multiple products can be shipped from the manufacturing location to different locations via multiple transportation modes. These transportation modes may have different transportation lead times. The transportation costs structure of the different transportation modes offer economies of scale and can be represented by general piecewise linear functions. The production system at the manufacturing location is a serial process with a bottleneck stage. At the bottleneck stage, a predetermined production sequence must be maintained as is the case in some process-based industries. We propose a tight mixed integer programming model for integrated planning of production and distribution in the network. We show that by adding simple valid inequalities and special 0-1 variables, major computational improvements can be achieved when solving this problem with commercial solvers such as Cplex. We also propose a sequential solution approach, based on the independent, but synchronized, solutions of the production and distribution sub-problems. Finally, the solution methods proposed are tested experimentally for realistic problems and the advantage of integrated planning over independent but synchronized planning is assessed.  相似文献   

13.
In this paper we address the production scheduling and distribution planning problem in a yoghurt production line of the multi-product dairy plants. A mixed integer linear programming model is developed for the considered problem. The objective function aims to maximize the benefit by considering the shelf life dependent pricing component and costs such as processing, setup, storage, overtime, backlogging, and transportation costs. Key features of the model include sequence dependent setup times, minimum and maximum lot sizes, overtime, shelf life requirements, machine speeds, dedicated production lines, typically arising in the dairy industry. The model obtains the optimal production plan for each product type, on each production line, in each period together with the delivery plan. The hybrid modelling approach is adopted to explore the dynamic behavior of the real world system. In the hybrid approach, operation time is considered as a dynamic factor and it is adjusted by the results of the simulation and optimization model iteratively. Thus, more realistic solutions are obtained for the scheduling problem in yoghurt industry by using the iterative hybrid optimization-simulation procedure. The efficiency and applicability of the proposed model and approach are demonstrated in a case study for a leading dairy manufacturing company in Turkey.  相似文献   

14.
This paper investigates properties of integer programming models for a class of production planning problems. The models are developed within a decision support system to advise a sales team of the products on which to focus their efforts in gaining new orders in the short term. The products generally require processing on several manufacturing cells and involve precedence relationships. The cells are already (partially) committed with products for stock and to satisfy existing orders and therefore only the residual capacities of each cell in each time period of the planning horizon are considered. The determination of production recommendations to the sales team that make use of residual capacities is a nontrivial optimization problem. Solving such models is computationally demanding and techniques for speeding up solution times are highly desirable. An integer programming model is developed and various preprocessing techniques are investigated and evaluated. In addition, a number of cutting plane approaches have been applied. The performance of these approaches which are both general and application specific is examined.  相似文献   

15.
In this research, we formulate and solve a type of the capacitated lot-sizing problem. We present a general model for the lot-sizing problem with backorder options, that can take into consideration various types of production capacities such as regular time, overtime and subcontracting. The objective is to determine lot sizes that will minimize the sum of setup costs, holding cost, backorder cost, regular time production costs, and overtime production costs, subject to resource constraints. Most existing formulations for the problem consider the special case of the problem where a single source of production capacity is considered. However, allowing for the use of alternate capacities such as overtime is quite common in many manufacturing settings. Hence, we provide a formulation that includes consideration of multiple sources of production capacity. We develop a heuristic based on the special structure of fixed charge transportation problem. The performance of our algorithm is evaluated by comparing the heuristic solution value to lower bound value. Extensive computational results are presented.  相似文献   

16.
Markov models are commonly used in modelling many practical systems such as telecommunication systems, manufacturing systems and inventory systems. However, higher-order Markov models are not commonly used in practice because of their huge number of states and parameters that lead to computational difficulties. In this paper, we propose a higher-order Markov model whose number of states and parameters are linear with respect to the order of the model. We also develop efficient estimation methods for the model parameters. We then apply the model and method to solve the generalised Newsboy's problem. Numerical examples with applications to production planning are given to illustrate the power of our proposed model.  相似文献   

17.
Based on the NEWUOA algorithm, a new derivative-free algorithm is developed, named LCOBYQA. The main aim of the algorithm is to find a minimizer $x^{*} \in\mathbb{R}^{n}$ of a non-linear function, whose derivatives are unavailable, subject to linear inequality constraints. The algorithm is based on the model of the given function constructed from a set of interpolation points. LCOBYQA is iterative, at each iteration it constructs a quadratic approximation (model) of the objective function that satisfies interpolation conditions, and leaves some freedom in the model. The remaining freedom is resolved by minimizing the Frobenius norm of the change to the second derivative matrix of the model. The model is then minimized by a trust-region subproblem using the conjugate gradient method for a new iterate. At times the new iterate is found from a model iteration, designed to improve the geometry of the interpolation points. Numerical results are presented which show that LCOBYQA works well and is very competing against available model-based derivative-free algorithms.  相似文献   

18.
We consider a manufacturer’s stochastic production/inventory problem under periodic review and present methods for safety stock determination to cope with uncertainties that are caused by stochastic demand and different types of yield randomness. Following well-proven inventory control concepts for this problem type, we focus on a critical stock policy with a linear order release rule. A central parameter of this type of policy is given by the safety stock value. When non-zero manufacturing lead times are taken into account in the random yield context, it turns out that safety stocks have to be determined that vary from period to period. We present a simple approach for calculating these dynamic safety stocks for different yield models. Additionally, we suggest approaches for determining appropriate static safety stocks that are easier to apply in practice. In a simulation study we investigate the performance of the proposed safety stock variants.  相似文献   

19.
In this paper, we investigate an iterative method which has been proposed [1] for the numerical solution of a special class of integral equations of the first kind, where one of the essential assumptions is the positivity of the kernel and the given right-hand side. Integral equations of this special type occur in experimental physics, astronomy, medical tomography and other fields where density functions cannot be measured directly, but are related to observable functions via integral equations. In order to take into account the non-negativity of density functions, the proposed iterative scheme was defined in such a way that only non-negative solutions can be approximated. The first part of the paper presents a motivation for the iterative method and discusses its convergence. In particular, it is shown that there is a connection between the iterative scheme and a certain concave functional associated with integral equations of this type. This functional can be interpreted as a generalization of the log-likelihood function of a model from emission tomography. The second part of the paper investigates the convergence properties of the discrete analogue of the iterative method associated with the discretized equation. Sufficient conditions for local convergence are given; and it is shown that, in general, convergence is very slow. Two numerical examples are presented.  相似文献   

20.
In an attempt to achieve a competitive edge, automotive companies operate global production networks to offer an ever increasing product variety, shorter and reliable lead times as well as competitively priced products. Cars are no longer exclusively produced based on standardized product configurations and stable sales plans but are increasingly build-to-order to match the needs of individual customers. Operations Research (OR) may contribute towards successful build-to-order operations. This is likewise reflected by the appreciable number of published papers on industry specific OR applications. To provide readers with an overview about these OR models and applications we identify current and future research issues based on the review of 49 works. We focus on two important planning objects which have not been considered in prior reviews: the planning of capacities and orders. To bridge the gap between conceptual works on the one hand and quantitative contributions on the other, we provide a framework for the structuring of planning tasks. Existing models are classified according to this framework and open issues that should be addressed in OR are discussed.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号