Dynamic scheduling of steel casting and milling using multi-agents

This paper presents a case study on the use of multi-agents for integrated dynamic scheduling of steel milling and casting. Steel production is an extremely complex problem requiring the consideration of several different constraints and objectives of a range of processes in a dynamic environment. Most research in steel production scheduling considers static scheduling of processes in isolation. In contrast to earlier approaches, the multi-agent architecture proposed consists of a set of heterogeneous agents which integrate and optimize a range of scheduling objectives related to different processes of steel production, and can adapt to changes in the environment while still achieving overall system goals. Each agent embodies its own scheduling model and realizes its local predictive-reactive schedule taking into account local objectives, real-time information and information received from other agents. Agents cooperate in order to find a globally good schedule, which is able to effectively react to real-time disruptions, and to optimize the original production goals whilst minimising disruption carried by unexpected events occurring in real-time. The inter-agent cooperation is based on the Contract Net Protocol with commitment.     

Multimode time-cost-robustness trade-off project scheduling problem under uncertainty

The time/cost trade-off problem is a well-known project scheduling problem that has been extensively studied. In recent years, many researchers have begun to focus on project scheduling problems under uncertainty to cope with uncertain factors, such as resource idleness, high inventory, and missing deadlines. To reduce the disturbance from uncertain factors, the aim of robust scheduling is to generate schedules with time buffers or resource buffers, which are capped by project makespan and project cost. This paper addresses a time-cost-robustness trade-off project scheduling problem with multiple activity execution modes under uncertainty. A multiobjective optimization model with three objectives (makespan minimization, cost minimization, and robustness maximization) is constructed and three propositions are proposed. An epsilon-constraint method-based genetic algorithm along with three improvement measures is designed to solve this NP-hard problem and to develop Pareto schedule sets, and a large-scale computational experiment on a randomly generated dataset is performed to validate the effectiveness of the proposed algorithm and the improvement measures. The final sensitivity analysis of three key parameters shows their distinctive influences on the three objectives, according to which several suggestions are given to project managers on the effective measures to improve the three objectives.

     

资源约束下多项目调度的改进遗传算法

针对资源约束下的多项目调度问题,在前人提出的有效的启发式算法研究路径基础上,本文利用遗传算法,结合进度生成机制,提出了多项目调度的改进遗传算法。与其他多项目调度启发式算法相比,该算法在平均项目延迟和最佳解比例方面都表现较好,综合利用优化后的优先规则也使得该算法更适用于不同网络复杂度和不同资源约束程度的多项目调度问题中。     

炼钢连铸生产调度问题的两阶段遗传算法

将炼钢连铸生产过程抽象为混合流水车间,建立了0-1型混合整数线性规划调度模型。模型将严格连续浇注作为等式约束,并通过分段惩罚来平衡炉次的驻留时间。在对模型进行Benders分解的基础上,提出了将GA与LP结合的两阶段遗传算法。在算法设计中,提出了一种新的染色体编码来表示炉次设备指派与排序方案,给出了相应的遗传操作方法。算法的第一阶段通过最小化设备析取冲突来寻找高质量的种群,第二阶段通过求解线性规划模型来指导遗传算法的迭代过程。基于生产实际数据的仿真实验表明,该算法能够有效求解炼钢连铸生产调度问题。     

Sequencing heuristics for dependent setups in a continuous process industry

In this paper we address the scheduling of Biaxially Oriented Polypropylene (BOPP) film production, which belongs to the plastics industry and is a continuous process. Scheduling problems in BOPP film production involve processing different thickness settings of films on a common facility. Customer orders of the same thickness setting are usually grouped together as a production batch and a setup time is incurred whenever the batch is switched. However, there is usually more than one batch for the same thickness setting because of the due date constraints of the orders. Therefore, there is a need to develop a batching and sequencing scheme that minimizes the total setup time, or equivalently the makespan, under the due date constraint. In this paper heuristics are developed to generate a near-optimal solution for the problem. The heuristics are evaluated by an optimal solution procedure and are tested by using the actual data from a plant making the BOPP film. Comparison of the heuristics with the results of the current system has demonstrated a significant reduction in total setup time.     

Minimizing tardiness on a single processor with sequence-dependent setup times: a simulated annealing approach

In today's fast-paced Just-In-Time and mass customization manufacturing in a sequence-dependent setup environment, the challenge of making production schedules to meet due-date requirements is becoming a more complex problem. Unfortunately, much of the research on operations scheduling problems has either ignored setup times or assumed that setup times on each machine are independent of the job sequence. This paper considers the problem of minimizing tardiness, a common measure of due-date performance, in a sequence-dependent setup environment. Simulated annealing was used to solve the sequencing problem, and its performance was compared with random search. Our experimental results show that the algorithm can find a good solution fairly quickly, and thus can rework schedules frequently to react to variations in the schedule. The algorithm is invaluable for ‘on-line’ production scheduling and ‘last-minute’ changes to production schedule. The results of this research also suggest ways in which more complex and realistic job shop environments, such as multiple machines with a higher number of jobs in the sequence, and other scheduling objectives can be modeled. This research also investigates computational aspects of simulated annealing in solving complex scheduling problems.     

Optimum common cycle for scheduling a single-machine multiproduct system with a budgetary constraint

This paper deals with the single machine multi-product lot size scheduling problem, and has two objectives. The first objective is to minimize the maximum aggregate inventory for the common cycle (CC) scheduling policy. A simple and easy-to-apply rule has been developed which determines the optimal production sequence that achieves this objective. The second objective is to find an optimal common cycle for minimizing the average production and inventory costs per unit time, subject to a given budgetary constraint. A method has been presented that achieves this objective     

Single process plan scheduling with genetic algorithms

AIn this paper, a genetic algorithm model for scheduling manufacturing resources is developed for the case when there is only one process plan available per job, hence there is no routeing flexibility. The scheduling objectives considered are minimizing the makespan and mean flow time. Genetic algorithms design issues are discussed and the working of the employed genetic operators is explained in detail. Parameters for the genetic algorithms used for single process plan scheduling SPPS problems are set through extensive experimentation. Finally, the genetic algorithms approach is compared with several other approaches in terms of optimality of solution and computAuthors: ing time. It was observed that in most cases the genetic algorithms approach performed better than other approaches both in terms of finding an optimal or near optimal solution as well as computing time.     

A Hierarchical Production Planning and Scheduling Model

A hierarchical production planning and scheduling system is developed that integrates planning decisions into a unified and consistent framework. A three-tiered approach is used to address long-term inventory control, short-term production planning, and daily scheduling tasks. A product grouping scheme introduces uniformity into the solution process and simplifies overall model complexity. Results of the model implementation are reported.     

An Analysis of Strategic Determinants,Learning and Decision‐Making in Sino‐British Joint Ventures

This paper examines how partners’ strategic objectives, inputs and competencies affect the learning they achieve in joint ventures and their ability to influence decision‐making in such ventures. Quantitative and qualitative research in 20 Sino‐British joint ventures permits an investigation of these factors for both British and Chinese joint venture partners. Findings indicate that the transfer by British partners of technology and managerial expertise to joint ventures enhances their ability to achieve their strategic objectives by influencing decisions in such ventures. The learning achieved by British partners depends on their commitment of strategic inputs to joint ventures and is therefore associated with their influence. The case of Chinese partners is different, because they look to learn from the knowledge and resource inputs provided by the British partners. They therefore rely more on legal ownership rights to retain an influence over joint venture decision‐making. The achievement of Chinese partners’ strategic objectives depends more critically on the quality of the partnership itself.     

MULTIPLE OBJECTIVES IN LINEAR PROGRAMMING –AN EXAMPLE IN SCHEDULING POSTAL RESOURCES

This paper describes a methodology to treat multiple objectives in a mathematical programming problem. A linear programming model is developed for the short-term manpower scheduling problem in a post office so as to get a desirable balance between mail transit times and resource expenditures. The scheduling problem is of particular interest because of 1) the multiplicity of objectives, 2) the existence of several mail classes, each having different arrival patterns, routings, and dispatch times, and 3) the complexity of the different scheduling options available. The paper demonstrates how the model can be used experimentally to obtain model parameters which, in the judgment of management, achieve a desirable balance between objectives. Once the parameters are determined, the model prescribes how to vary the overtime usage, reassign workers to the various work stations, and adjust the priorities of the mail classes. The model has indirect use in studying the effects of changing work capacities, dispatch schedules, and mail arrival patterns.     

Priority class scheduling: Production scheduling for multi-objective environments

A new scheduling framework (priority class scheduling) is devised which reduces the conflict in the manufacturingmarketing interface. Priority class scheduling rewards manufacturing for making small improvements in efficiency, involves marketing in the setting of production priorities, improves customer service by putting in place realistic production timetables, allows manufacturing to concentrate on improving both quality and efficiency, and improves both the communication and cooperation between the shop floor, the production scheduler, marketing, and customer service. Within a production period, all jobs are classified into priority classes based on both their due dates and importance. Production is scheduled within each production period to maximize throughput subject to the priority class constraints- if any job in priority class i is started in the production period, then all jobs in priority class i - 1 must be completed within the production periods.     

A framework for studying practical production scheduling

The aim of this paper is to present what we believe are the most relevant findings and results regarding practical scheduling in order to define practical production scheduling and create a framework that helps researchers to study the various topics that fall under the umbrella of practical production scheduling and to identify the current state of knowledge for each topic. Studies from different fields were analysed and included in this paper, contributing significant knowledge to build a definition of practical production scheduling. Finally, we discuss the applicability that scheduling, as a task, could have in real companies.     

具有时间转换约束的离散时间-费用权衡问题研究

离散时间-费用权衡问题(DTCTP)是项目进度中研究最多的双目标优化问题,它通常以三种形式出现:(1)P1:截止日期问题,在项目截止日期约束下使完成项目的总费用最小;(2)P2:预算问题,在费用预算约束下使项目工期最短;(3)P3:工期-费用曲线问题,找出全部有效的工期-费用模式集合。然而,考虑时间转换约束(TSC)的DTCTP却很少被关注。本文首先介绍时间转换约束的问题描述,在此基础上,建立具有活动类型时间转换约束的DTCTPTSC-P2模型;从实用角度出发,设计求解模型的遗传算法;最后,用一个真实项目实例说明模型的合理性和算法的有效性,对算例分析结果表明,该模型对承包商更准确地进行项目工期-费用权衡决策具有借鉴意义。     

一种策略层项目计划的双目标优化方法

针对产品开发项目管理的实际情况,对策略层计划优化方法进行研究。以工作包的工作量估算为基础,以资源投入水平和工期最小化为目标,考虑各种约束条件,提出一种策略层项目计划问题的混合整数规划问题模型。以非支配遗传算法NSGA-II为基础框架,设计了一种改进的双目标遗传算法。该算法针对问题的特点,提出了基于资源平滑的解码算法。参考NSGA-III的关键特征,对拥挤密度计算方法进行改进。通过企业实际项目案例,验证了算法的性能和所提出的策略层项目计划方法的有效性。     

Single machine scheduling: A comparison of two solution procedures

Recent research on the single machine scheduling problem has focused on the treatment of multiple scheduling objectives. Most works have used some combination of mean flowtime, maximum tardiness, or total tardiness as scheduling criteria. Previous research has largely ignored earliness as a scheduling criterion. This paper presents a model that employs the criteria of flowtime as a measure of work-in-process (WIP) inventory and total job earliness to represent finished goods inventory. Total tardiness is used to represent customer satisfaction. The three criteria are used to form a single, weighted-sum objective function for guiding the choice of the best processing sequence. Two procedures are presented that might be used to solve this problem. The first is an enumeration scheme using bounding and dominance criteria that have been developed to aid efficient solution, and the second is a mixed integer linear programming (LP) formulation. Computational experience with the two models is also presented.     

面向并行制造的多生产单元协同调度研究

为提升多生产单元制造系统整体效率，在其系统内开展面向并行制造的协同调度研究，在考虑运输、换线等时间的基础上，构建多生产单元并行协同调度模型，采用并行分段协同遗传算法求解；在此基础上，将所研究协同调度方法应用于某复杂机电产品多生产单元制造车间，并与变批量调度与等批量调度比较。研究表明，所提的并行协同调度方法可以显著提升生产单元效率，提高生产单元设备和人员利用率。     

Genetic algorithm to production planning and scheduling problems for manufacturing systems

Fundamental and extended multi-objective (MO) models are designed to address earliness/tardiness production scheduling planning (ETPSP) problems with multi-process capacity balance, multi-product production and lot-size consideration. A canonical genetic algorithm (GA) approach and a prospective multi-objective GA (MOGA) approach are proposed as solutions for different practical problems. Simulation results as well as comparisons with other techniques demonstrate the effectiveness of the MOGA approach, which is a noted improvement to any of the existing techniques, and also in practice provides a new trend of integrating manufacturing resource planning (MRPII) with just-in-time (JIT) in the production planning procedure.     

基于图的广度搜索的进度生成机制

启发式算法是解决资源受限的项目调度问题的经典方法之一，通常用来生成元启发算法初始解，传统的串行（SSGS）和并行（PSGS）是生成项目调度方案的经典机制，本文基于图的广度优先搜索算法，提出了一种考虑任务节点位置因素的广度生成机制（BSSGS），并验证了算法的效果。借鉴广度搜索算法定义进度生成机制中的当前任务集合C、候选任务集合D以及阶段变量g等，对各任务节点进行层次划分并定义任务调度秩序；结合优先规则选择候选任务j^*并进行资源R_k（t）调度更新，进而生成完整的调度方案；案例分析表明新机制在满足优先规则和资源约束的同时兼顾了任务节点在网络中位置因素，拥有对于局部复杂网络不回避，对关键节点及时调度等明显优势；选择PSPLIB中算例，在不同优先规则下对新机制进行了测试，测试结果表明新的进度生成机制在LPT、SPT、MTS和MIS等优先规则下，在平均最短工期、平均资源利用率及最优调度方案率等方面优于串行和并行进度生成机制，且算法时间复杂度与传统机制相比并未增加，仍为O（J²，K）。     

舆情传播中考虑公众风险感知的多资源流应急优化调度

针对舆情传播背景下应急资源调度问题的特殊性,首先运用多案例分析进行了具体描述。然后,考虑到公众的有限理性,运用前景理论对其风险感知行为进行了刻画,并给出了保留供应率的定义。进一步,运用模糊理论来刻画公众追溯以往的资源供应状况,在同时考虑到供应点和配送中心的能力扩充基础上,构建了多种类资源应急优化调度的0-1混合整数非线性模糊规划模型。最后,以2011年东日本大地震事件为例验证了理论研究的有效性,并考查了决策者在控制公众风险感知中的偏好行为对最优调度方案的影响。