Applying kaizen to the schedule in a concurrent environment

Not only ETO (Engineering to Order), but even serial production industry should know how to deal with projects and their schedule: plant commissioning, shutdown, introducing new products and similar circumstances should be managed with adequate planning and resource allocation techniques to create a schedule useful in decision making during the execution. The current complex reality, with evolving technologies and fierce pressure to reach the market as soon as possible, pushes the project managers to use more advanced techniques than waterfall planning, such as agile or lean. It also requires them to take a holistic view and manage concurrent tasks in complex projects. The contributions of this paper are two: the proposal to control specific parallel groups of waterfall activities under uncertain environments, which can lead to iterations and reworks, as a single concurrent Activity Managed by Kanban Methods (AMKM). This activity can be subsequently embedded into traditional scheduling approaches as CPM-PERT. The second contribution is the feasibility of its application in industrial environments due to the affordability of simulation software. Two use cases are shown as evidence. It is not a disruptive proposal, but a kaizen action based on very mature technologies. Finally, it is suggested some improvements to be implemented in Project Management Software due to this ‘kaizen’ proposal.     

基于GPS／GSM／GIS集成的动态车辆优化调度的研究

目前,GPS(全球定位系统)、GSM(数字蜂窝移动通信系统)和GIS(地理信息系统)都是成熟的商业技术。运用这些技术,再结合Dijstra最短路和贪心算法,可合理实现单配送中心、非满载送货条件下的车辆优化调度,提高配送效率。     

无线传感器网络中覆盖性问题的研究

无线传感器网络由大量的具有低能量,短寿命并且不可靠的传感器节点组成,因此在设计无线传感器网络时一个主要的目标在于保证足够的覆盖率以及能量可靠性的前提下可以延长网络的寿命。本文介绍了几种减少能量消耗以延长网络寿命的节点调度方法,并比较了各种方法的优缺点,指出其应用环境和需要进一步研究的工作。最后在这几种算法的基础上提出了一种新的算法。     

Stochastic Modelling of Times to Temperature for Furnaces Supplying Titanium Blooms to a Rolling Mill at TIMET

In conjunction with TIMET at Waunarlwydd (Swansea, UK) a model has been developed that will optimise the scheduling of various blooms to their eight furnaces so as to minimise the time taken to roll these blooms into the finished mill products. This production scheduling model requires reliable data on times taken for the various furnaces that heat the slabs and blooms to reach the temperatures required for rolling. These times to temperature are stochastic in nature and this paper identifies the distributional form for these times using the generalised F distribution as a modelling framework. The times to temperature were found to be similarly distributed over all furnaces. The identified distributional forms were incorporated into the scheduling model to optimise a particular campaign that was run at TIMET Swansea. Amongst other conclusion it was found that, compared to the actual campaign, the model produced a schedule that reduced the makespan by some 35%.     

考虑交通时间与设备转换时间的跨区域就医调度优化问题

在资源共享时代背景下,跨区域就医可以很好地解决患者日益增长的就医需求与医疗资源紧张的矛盾。本论文以医疗联盟为研究对象,在关键医疗资源共享的前提下,通过患者跨区域就医实现就医诊断延误最小化,以满足患者就医需求。本研究同时考虑了患者跨区域交通时间与基于患者诊断类型的设备转换时间,以最小化患者就医总延迟为目标,分配患者就诊医院及优化患者就诊/检查顺序。针对该问题,论文首次提出以最早交货期原则（EDD rule）为基础,以患者再分配为主导的EDD-ReAss1和EDD-ReAss2启发式算法,结合局部搜索算法以进一步提高就医调度方案的质量,缩短患者诊断/检查等待时间。实验结果表明,新启发式算法EDD-ReAss1和EDD-ReAss2算法性能显著好于EDD,SPT和LPT等调度规则;在较短运算时间内Swap局部搜索算法性能最优。     

Staff rostering in call centers providing employee transportation

We address the staff rostering problem in call centers with the goal of balancing operational cost, agent satisfaction and customer service objectives. In metropolitan cities such as Istanbul and Mumbai, call centers provide the transportation of their staff so that shuttle costs constitute a significant part of the operational costs. We develop a mixed integer programming model that incorporates the shuttle requirements at the beginning and end of the shifts into the agent-shift assignment decisions, while considering the skill sets of the agents, and other constraints due to workforce regulations and agent preferences. We analyze model solutions for a banking call center under various management priorities to understand the interactions among the conflicting objectives. We show that considering transportation costs as well as agent preferences in agent-shift assignments provides significant benefits in terms of both cost savings and employee satisfaction.     

A harmony search-based memetic optimization model for integrated production and transportation scheduling in MTO manufacturing

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.     

Unaddressed problems and research perspectives in scheduling blood collection from donors

Many optimisation problems arise in managing the Blood Donation (BD) supply chain. Most of them have been addressed in the literature, while other problems, e.g. donation scheduling, have not been sufficiently addressed so far. However, blood collection from donors may have a disruptive impact on the entire BD supply chain if not properly managed. For example, scheduling donation appointments based on some system metrics may improve the flow of blood units through the BD supply chain and increase the quality of service perceived by donors. In this short communication, we present the donation scheduling problem and highlight the lack of work in the literature that deals with this problem. Then, we analyse the impact of an unbalanced flow of blood units on the BD system and the benefits that may derive from a suitable appointment scheduling. Finally, we propose suggestions for future research in BD collection scheduling that may improve the BD process.     

Minimization of passenger takeoff and landing risk in offshore helicopter transportation: Models,approaches and analysis

Offshore petroleum industry uses helicopters to transport the employees to and from installations. Takeoff and landing represent a substantial part of the flight risks for passengers. In this paper, we propose and analyze approaches to create a safe flight schedule to perform pickup of employees by several independent flights. Two scenarios are considered. Under the non-split scenario, exactly one visit is allowed to each installation. Under the split scenario, the pickup demand of an installation can be split between several flights. Interesting links between our problem and other problems of combinatorial optimization, e.g., parallel machine scheduling and bin-packing are established. We provide worst-case analysis of the performance of some of our algorithms and report the results of computational experiments conducted on randomly generated instances based on the real sets of installations in the oil fields on the Norwegian continental shelf. This paper is the first attempt to handle takeoff and landing risk in a flight schedule that consists of several flights and lays ground for the study on more advanced and practically relevant models.     

Production and changeover control policies of a class of failure prone buffered flow-shops

This article deals with a stochastic optimal control problem for a class of buffered multi-parts flow-shops manufacturing system. The involved machines are subject to random breakdowns and repairs. The flow-shop under consideration is not completely flexible and hence requires setup time and cost in order to switch the production from a part type to another, this changeover is carried on the whole line. Our objective is to find the production plan and the sequence of setups that minimise the cost function, which penalises inventories/backlogs and setups. A continuous dynamic programming formulation of the problem is presented. Then, a numerical scheme is adopted to solve the obtained optimality conditions equations for a two buffered serial machines two parts case. A complete heuristic policy, based on the numerical observations which describe the optimal policies in system states, is developed. It will be shown that the obtained policy is a combination of a KANBAN/CONWIP and a modified hedging corridor policy. Moreover, based on our observations and existent research studies extension to cover more complex flow-shops is henceforth possible. The robustness of such a policy is illustrated through sensitivity analysis.