共查询到20条相似文献,搜索用时 3 毫秒
1.
Beat Gfeller Leon Peeters Birgitta Weber Peter Widmayer 《Journal of Combinatorial Optimization》2009,17(3):323-338
Motivated by a high-throughput logging system, we investigate the single machine scheduling problem with batching, where jobs
have release times and processing times, and batches require a setup time. Our objective is to minimize the total flow time,
in the online setting. For the online problem where all jobs have identical processing times, we propose a 2-competitive algorithm
and we prove a corresponding lower bound. Moreover, we show that if jobs with arbitrary processing times can be processed
in any order, any online algorithm has a linear competitive ratio in the worst case.
A preliminary version of a part of this paper was presented at the 31st International Symposium on Mathematical Foundations
of Computer Science (MFCS 2006). We gratefully acknowledge reviewers’ comments that helped to improve the presentation of
this work.
Supported by the Swiss SBF under contract no. C05.0047 within COST-295 (DYNAMO) of the European Union.
Research carried out while B. Weber was affiliated with the Institute of Theoretical Computer Science, ETH Zurich. 相似文献
2.
This paper addresses a batch delivery single-machine scheduling problem in which jobs have an assignable common due window. Each job will incur an early (tardy) penalty if it is early (tardy) with respect to the common due window under a given schedule. There is no capacity limit on each delivery batch, and the cost per batch delivery is fixed and independent of the number of jobs in the batch. The objective is to find the optimal size and location of the window, the optimal dispatch date for each job, as well as an optimal job sequence to minimize a cost function based on earliness, tardiness, holding time, window location, window size, and batch delivery. We show that the problem can be optimally solved in O(n8) time by a dynamic programming algorithm under a reasonable assumption on the relationships among the cost parameters. A computational experiment is also conducted to evaluate the performance of the proposed algorithm. We also show that some special cases of the problem can be optimally solved by lower order algorithms. 相似文献
3.
GUR MOSHEIOV 《生产规划与管理》2013,24(4):401-406
The option of pre-emption seems to have escaped the attention of existing literature on scheduling problems with earliness and tardiness costs. This note presents an attempt to accommodate pre-emption in such settings. The focus is on models with a common due date for all jobs under different cost structures ( job dependent versus job independent), and different objectives ( minsum and minmax). It appears that only one of these cases is not polynomially solvable: the case of minsum objective and job-dependent ( linear) cost. An exact dynamic programming algorithm is introduced for this problem, as well as an efficient heuristic, which is shown to perform extremely well in our numerical tests. 相似文献
4.
Paulina Myrelid 《生产规划与管理》2017,28(3):232-243
The purpose of this paper is to explore how different delivery schedule characteristics affect the quality of shared delivery schedule information and, in turn, how deficiencies in quality affect a supplier’s production scheduling process. It describes a case study conducted in the Swedish automotive industry involving a supplier that operates as the first-, second- and third-tier supplier to an original equipment manufacturer. The study reveals how four delivery schedule characteristics – namely, receiving frequency, planning period, frozen period and demand variation – create information quality (IQ) deficiencies in five dimensions of IQ: completeness, conciseness, reliability, timeliness and credibility. At the same time, it demonstrates how such deficiencies affect the supplier’s production scheduling process by requiring additional rescheduling, reworking and follow-up activities as well as additional capacity problems, safety time, safety stock and backlogs. In effect, the paper extends previous IQ-related research by considering IQ in delivery schedules. 相似文献
5.
The oil supply chain is facing new challenges due to emerging issues such as new alternative energy sources, oil sources scarcity, and price variability with high impact on demand and production and profit margins reduction. Additionally, the existence of large, complex and world wide spread businesses implies a complex system to be managed where distribution can be seen as one of the key areas that needs to be efficiently and effectively managed. Different types of distribution modes characterize the oil supply chain where the pipeline mode is one of the most complex to operate when having multiproduct characteristics. This paper addresses the planning of a generic oil derivatives transportation system characterized by a multiproduct pipeline that connects a single refinery to a storage tank farm. Two alternative mixed integer linear programming models (MILP) that aim to attain a set of planning objectives such as fulfilling costumers’ demands (which is mandatory) while minimizing the medium flow rate are developed. Additionally, final inventory levels are avoided to be excessively low. A real world scenario of a Portuguese company is used to validate and compare the two alternative MILP models developed in this paper. 相似文献
6.
This paper studies the on-line production order scheduling problem where each preemption causes a penalty, and the objective
is to maximize the net profit, i.e., the total weights of completed orders minus the total penalties caused by preemptions.
Two greedy strategies are shown to be at best and -competitive respectively, where Δ is the ratio between the longest and shortest length of order. After that we mainly present
an improved strategy, named WAL, which takes advantage of the knowledge of Δ and is proved to be -competitive for Δ > 9. Furthermore, two lower bounds for deterministic strategies, and 6.33, are given for the cases of nonuniform and uniform length respectively.
This research is supported by NSF of China under Grants 70471035, 70525004, 70121001 and 70602031. 相似文献
7.
This paper addresses a three-machine assembly-type flowshop scheduling problem, which frequently arises from manufacturing process management as well as from supply chain management. Machines one and two are arranged in parallel for producing component parts individually, and machine three is an assembly line arranged as the second stage of a flowshop for processing the component parts in batches. Whenever a batch is formed on the second-stage machine, a constant setup time is required. The objective is to minimize the makespan. In this study we establish the strong NP-hardness of the problem for the case where all the jobs have the same processing time on the second-stage machine. We then explore a useful property, based upon which a special case can be optimally solved in polynomial time. We also study several heuristic algorithms to generate quality approximate solutions for the general problem. Computational experiments are conducted to evaluate the effectiveness of the algorithms. 相似文献
8.
价格波动的情况下如何进行原材料采购,并在产品的生产决策中如何权衡市场需求、产品价格以及采购与库存成本等问题是当前很多企业面临的普遍难题.对此类问题,假定原材料的价格波动服从马尔可夫过程,成品的市场需求为与价格相关的随机变量,进而建立了多周期库存采购与生产联合决策模型,并分析了系统的动态最优策略.模型同时考虑了原材料买进或者卖出决策和成品生产决策.研究结果表明,模型的最优策略,即原材料库存决策与成品生产决策均满足动态基库存策略.同时证明了一系列性质,这些性质展示了原材料价格波动下最优库存策略的特征.数值实验进一步验证了模型的最优策略,并研究了参数变化时最优策略的变化. 相似文献
9.
In this paper, we consider the single-machine scheduling problem with production and rejection costs to minimize the maximum earliness. If a job is accepted, then this job must be processed on the machine and a corresponding production cost needs be paid. If the job is rejected, then a corresponding rejection cost has to be paid. The objective is to minimize the sum of the maximum earliness of the accepted jobs, the total production cost of the accepted jobs and the total rejection cost of the rejected jobs. We show that this problem is equivalent to a single-machine scheduling problem to minimize the maximum earliness with two distinct rejection modes. In the latter problem, rejection cost might be negative in the rejection-award mode which is different from the traditional rejection-penalty mode in the previous literatures. We show that both of two problems are NP-hard in the ordinary sense and then provide two pseudo-polynomial-time algorithms to solve them. Finally, we also show that three special cases can be solved in polynomial time. 相似文献
10.
《Omega》2019
This paper presents a generalized production-inventory-routing model with perishable inventory. We analyze the optimal integrated decisions of when and how much to deliver and sell products with varying manufacturing periods. We discuss main inventory management policies to demonstrate the applicability of the model in real-world applications for production routing problems (PRPs) with perishable inventory. Furthermore, an exact branch-and-cut algorithm is developed and discussed. We introduce new families of logical, strengthened lot-sizing and lifted Miller–Tucker–Zemlin subtour elimination constraints for the PRP with perishable inventory. Finally, we test the performance of the algorithm. We also implement and compare 8 suboptimal delivery and selling priority policies with an optimized policy to develop managerial implications. 相似文献
11.
《Omega》2016
This paper presents a bi-objective stochastic mixed integer programming approach for a joint selection of suppliers and scheduling of production and distribution in a multi-echelon supply chain subject to local and regional disruption risks. Two conflicting problem objectives are minimization of cost and maximization of service level. The three shipping methods are considered for distribution of products: batch shipping with a single shipment of different customer orders, batch shipping with multiple shipments of different customer orders and individual shipping of each customer order immediately after its completion. The stochastic combinatorial optimization problem is formulated as a time-indexed mixed integer program with the weighted-sum aggregation of the two objective functions. The supply portfolio is determined by binary selection and fractional allocation variables while time-indexed assignment variables determine the production and distribution schedules. The problem formulation incorporates supply–production, production–distribution and supply–distribution coordinating constraints to efficiently coordinate supply, production and distribution schedules. Numerical examples modelled after an electronics supply chain and computational results are presented and some managerial insights are reported. The findings indicate that for all shipping methods, the service-oriented supply portfolio is more diversified than the cost-oriented portfolio and the more cost-oriented decision-making, the more delayed the expected supply, production and distribution schedules. 相似文献
12.
《Omega》2015
In this paper, an economic order quantity inventory model is analyzed, considering that the unit cumulative holding cost has two significant components: a fixed cost which represents the cost of accommodating the item in the warehouse and a variable cost given by a potential function of the length of time over which the item is held in stock. Shortages are allowed and, during the stockout period, only a fraction of demand is partially backordered. The backordering cost includes a fixed cost and a cost linearly dependent on the length of time for which backorder exists. A solution procedure is developed for determining the optimal inventory policy. Moreover, to illustrate the effects of some parameters on the optimal policy and the minimum total inventory cost, a numerical study is developed. 相似文献
13.
In this paper, we revisit the economic lot scheduling problem (ELSP), where a family of products is produced on a single machine, or facility, on a continual basis. Our focus is on the determination of a feasible production schedule, including the manufacturing batch size of each item. We assume that total backordering is permissible and that each of the products has a limited post-production shelf life. Several studies examining this problem have suggested a rotational common cycle approach, where each item is produced exactly once every cycle. To ensure schedule feasibility, we resort to the technique of reducing individual production rates and allow the flexibility of producing any item more than once in every cycle, in conjunction with appropriate timing adjustments. In order to solve this more generalized model, which is NP hard, we suggest a two-stage heuristic algorithm. A numerical example demonstrates our solution approach. 相似文献
14.
采取活动重叠模式通常是加速研发的有效手段,带有活动重叠的资源受限项目调度问题是经典资源受限项目调度问题的扩展.首先,深入分析了活动重叠对于项目调度的影响,对活动重叠及其不确定进行详细描述与建模,提出了活动重叠导致下游活动返工时间的二项分布概率模型;其次,构建了以最小化研发项目期望工期为目标的优化调度模型,设计了基于串行进度生成机制的遗传算法对大规模问题进行优化求解;最后,基于PSPLIB J60问题库中480个算例分析了该算法的计算结果,并考察了网络参数、资源参数和重叠参数变化时,采用活动重叠模式对缩短项目工期的影响.研究结果表明:活动对资源的需求强度越小或资源稀缺程度越低,可重叠活动对数量就会增加,项目工期缩短得越明显;网络复杂度的变化对缩短项目工期的影响不大;项目中重叠活动对越多,重叠导致的下游活动返工的概率越小,项目工期缩短的越明显. 相似文献
15.
《Omega》2017
This paper investigates an integrated production and transportation scheduling problem in an MTO supply chain. A harmony search-based memetic optimization model is developed to handle this problem, in which certain heuristic procedures are proposed to convert the investigated problem into an order assignment problem. A novel improvisation process is also proposed to improve the optimum-seeking performance. The effectiveness of the proposed model is validated by numerical experiments. The experimental results show that (1) the proposed model can solve the investigated problem effectively and that (2) the proposed memetic optimization process exhibits better optimum-seeking performance than genetic algorithm-based and traditional memetic optimization processes. 相似文献
16.
This paper considers an inventory system with non-instantaneous deteriorating item in which demand rate is a function of advertisement of an item and selling price. This paper aids the retailer in maximizing the total profit by determining optimal inventory and marketing parameters. In contrast to previous inventory models, an arbitrary holding cost rate and arbitrary deterioration rate have been incorporated to provide general framework to the model. First, a mathematical model is formulated and then some useful theoretical results have been framed to characterize the optimal solutions. The necessary and sufficient conditions for the existence and uniqueness of the optimal solutions are also derived. An algorithm is designed to find the optimum solutions of the proposed model. Numerical examples are included to illustrate the algorithmic procedure and the effects of key parameters are studied to analyze the behavior of the model. 相似文献
17.
A multi-item inventory model with constant demand and infinite replenishment is developed under the restrictions on storage area, total average shortage cost and total average inventory investment cost. These restrictions may be precise or imprecise. Here, it is assumed that inventory costs are directly proportional to the respective quantities, and unit purchase/production cost is inversely related to the demand. Restricted shortages are allowed but fully backlogged. First, the problem is formulated in crisp environment taking the deterministic and precise inventory parameters. It is solved by both geometric programming (GP) and gradient-based non-linear programming (NLP) methods. Later, the problem is formulated with fuzzy goals on constraints and objectives where impreciseness is introduced through linear membership functions. It is solved using the fuzzy geometric programming (FGP) method. The inventory models are illustrated with numerical values and compared with the crisp results. A sensitivity analysis on the optimum order quantity and average cost is also presented due to the variation in the tolerance of total average inventory investment cost and total average shortage cost following Dutta et al., 1993, Fuzzy Sets and Systems, 55, 133-142. 相似文献
18.
We study a variant of classical scheduling, which is called scheduling with “end of sequence” information. It is known in advance that the last job has the longest processing time. Moreover, the last job is marked, and thus it
is known for every new job whether it is the final job of the sequence. We explore this model on two uniformly related machines,
that is, two machines with possibly different speeds. Two objectives are considered, maximizing the minimum completion time
and minimizing the maximum completion time (makespan). Let s be the speed ratio between the two machines, we consider the competitive ratios which are possible to achieve for the two
problems as functions of s. We present algorithms for different values of s and lower bounds on the competitive ratio. The proposed algorithms are best possible for a wide range of values of s. For the overall competitive ratio, we show tight bounds of ϕ + 1 ≈ 2.618 for the first problem, and upper and lower bounds
of 1.5 and 1.46557 for the second problem.
The authors would like to dedicate this paper to the memory of our colleague and friend Yong He who passed away in August
2005 after struggling with illness.
D. Ye: Research was supported in part by NSFC (10601048). 相似文献
19.
In this paper, we study the problem of selecting the optimum production batch size in multistage manufacturing facilities with scrap and determining the optimal amount of investment. We analyse the effect of investment for quality improvement on the reduction of the proportion of defectives, and the effect of this reduction on processing cost, setup cost, holding cost, and profit loss. The quality characteristic of the product manufactured is assumed to be normally distributed with a mean equal to the target value. The purpose of the investment is to reduce the variance of the quality characteristic and hence the proportion of defectives. The model assumes known demand, which must be satisfied completely, scrappage at each stage and profit loss due to scrap. Using this model, the optimal values of the production quantity and the proportion of defectives for minimizing the total cost are obtained. The optimal investment is then obtained using the relationship between the investment and the proportion of defectives. 相似文献