8,361 research outputs found
Recommended from our members
A Digital Twin Framework for Production Planning Optimization: Applications for Make-To-Order Manufacturers
In this dissertation, we develop a Digital Twin framework for manufacturing systems and apply it to various production planning and scheduling problems faced by Make-To-Order (MTO) firms. While this framework can be used to digitally represent a particular manufacturing environment with high fidelity, our focus is in using it to generate realistic settings to test production planning and scheduling algorithms in practice. These algorithms have traditionally been tested by either translating a practical situation into the necessary modeling constructs, without discussion of the assumptions and inaccuracies underlying this translation, or by generating random instances of the modeling constructs, without assessing the limitations in accurately representing production environments. The consequence has been a serious gap between theory advancement and industry practice. The major goal of this dissertation is to develop a framework that allows for practical testing, evaluation, and implementation of new approaches for seamless industry adoption. We develop this framework as a modular software package and emphasize the practicality and configurability of the framework, such that minimal modelling effort is required to apply the framework to a multitude of optimization problems and manufacturing systems. Throughout this dissertation, we emphasize the importance of the underlying scheduling problems which provide the basis for additional operational decision making. We focus on the computational evaluation and comparisons of various modeling choices within the developed frameworks, with the objective of identifying models which are both effective and computationally efficient. In Part 1 of this dissertation, we consider a class of Production Planning and Execution problems faced by job shop manufacturing systems. In Part 2 of this dissertation, we consider a class of scheduling problems faced by manufacturers whose production system is dominated by a single operation
New Scheduling Algorithms and Digital Tool for Dynamic Permutation Flowshop with Newly Arrived Order
MASDScheGATS - Scheduling System for Dynamic Manufacturing Environmemts
This chapter addresses the resolution of scheduling in manufacturing systems subject to
perturbations. The planning of Manufacturing Systems involves frequently the resolution of a huge amount and variety of combinatorial optimisation problems with an important
impact on the performance of manufacturing organisations. Examples of those problems are the sequencing and scheduling problems in manufacturing management, routing and
transportation, layout design and timetabling problems
MASDScheGATS: a prototype system for dynamic scheduling
A manufacturing system has a natural dynamic nature observed through several kinds of random occurrences and
perturbations on working conditions and requirements over time. For this kind of environment it is important the
ability to efficient and effectively adapt, on a continuous basis, existing schedules according to the referred
disturbances, keeping performance levels. The application of Meta-Heuristics and Multi-Agent Systems to the
resolution of this class of real world scheduling problems seems really promising.
This paper presents a prototype for MASDScheGATS (Multi-Agent System for Distributed Manufacturing
Scheduling with Genetic Algorithms and Tabu Search)
An integrated approach for remanufacturing job shop scheduling with routing alternatives.
Remanufacturing is a practice of growing importance due to increasing environmental awareness and regulations. However, the stochastic natures inherent in the remanufacturing processes complicate its scheduling. This paper undertakes the challenge and presents a remanufacturing job shop scheduling approach by integrating alternative routing assignment and machine resource dispatching. A colored timed Petri net is introduced to model the dynamics of remanufacturing process, such as various process routings, uncertain operation times for cores, and machine resource conflicts. With the color attributes in Petri nets, two types of decision points, recovery routing selection and resource dispatching, are introduced and linked with places in CTPN model. With time attributes in Petri nets, the temporal aspect of recovery operations for cores as well as the evolution dynamics in cores\u27 operational stages is mathematically analyzed. A hybrid meta-heuristic algorithm embedded scheduling strategy over CTPN is proposed to search for the optimal recovery routings for worn cores and their recovery operation sequences on workstations, in minimizing the total production cost. The approach is demonstrated through the remanufacturing of used machine tool and its effectiveness is compared against another two cases: baseline case with fixed recovery process routings and case 2 using standard SA/MST
An integrated MRP and finite scheduling system to derive detailed daily schedules for a manufacturing shop
Many companies rely on Material Requirements Planning (MRP) to support their Production Scheduling and Control (PS&C) functions. Since MRP does not provide a detailed shop floor schedule, these users have to implement either a third party procedure or an internally developed procedure for shop floor controls. In this thesis we consider a class of user shops which are characterized by the following features:
Homogenous machines, that is all machines can produce all products.
Each product requires a setup, but several products may have a common setup.
MRP requirements are specified on a weekly basis while actual requirements are specified on a hourly basis.
Specifically, we develop a MRP and Finite Scheduling System (MFSS) which calculates the weekly net change requirements of products, then generates the detailed daily job order schedules, and finally sequences jobs on machine queues. The objectives of the system are to maximize the utilization of the machines and to minimize setup times. The MFSS was programmed on a personal computer-based system utilizing off-the-shelf relational database software
The Batch Scheduling Model for Dynamic Multi-Item, Multi-Level Production in an Assembly Job Shop with Parallel Machines
Most classical scheduling approaches deal with single products, single machines, and static manufacturing environments. In real-world manufacturing systems, however, scheduling can be assigned for multi-item production on multimachines in a dynamic environment in which unexpected new orders may be received. This paper focuses on scheduling problems in an assembly job shop with parallel machines that produce multi-item multi-level products. Models were developed for due date fulfillment and due date assignment in static and dynamic conditions, with the objectives of minimizing total actual flow time, while considering the defect rate at each stage of the process. The insertion technique was used in the scheduling process; insertion can be performed in batch operations at all available positions on all machines. A hypothetical case of job shop scheduling problems associated with multi-item, multi-level production on parallel machines was studied, and the computational results demonstrated the validity of the proposed algorithms
Best matching processes in distributed systems
The growing complexity and dynamic behavior of modern manufacturing and service industries along with competitive and globalized markets have gradually transformed traditional centralized systems into distributed networks of e- (electronic) Systems. Emerging examples include e-Factories, virtual enterprises, smart farms, automated warehouses, and intelligent transportation systems. These (and similar) distributed systems, regardless of context and application, have a property in common: They all involve certain types of interactions (collaborative, competitive, or both) among their distributed individuals—from clusters of passive sensors and machines to complex networks of computers, intelligent robots, humans, and enterprises. Having this common property, such systems may encounter common challenges in terms of suboptimal interactions and thus poor performance, caused by potential mismatch between individuals. For example, mismatched subassembly parts, vehicles—routes, suppliers—retailers, employees—departments, and products—automated guided vehicles—storage locations may lead to low-quality products, congested roads, unstable supply networks, conflicts, and low service level, respectively. This research refers to this problem as best matching, and investigates it as a major design principle of CCT, the Collaborative Control Theory.
The original contribution of this research is to elaborate on the fundamentals of best matching in distributed and collaborative systems, by providing general frameworks for (1) Systematic analysis, inclusive taxonomy, analogical and structural comparison between different matching processes; (2) Specification and formulation of problems, and development of algorithms and protocols for best matching; (3) Validation of the models, algorithms, and protocols through extensive numerical experiments and case studies. The first goal is addressed by investigating matching problems in distributed production, manufacturing, supply, and service systems based on a recently developed reference model, the PRISM Taxonomy of Best Matching. Following the second goal, the identified problems are then formulated as mixed-integer programs. Due to the computational complexity of matching problems, various optimization algorithms are developed for solving different problem instances, including modified genetic algorithms, tabu search, and neighbourhood search heuristics. The dynamic and collaborative/competitive behaviors of matching processes in distributed settings are also formulated and examined through various collaboration, best matching, and task administration protocols. In line with the third goal, four case studies are conducted on various manufacturing, supply, and service systems to highlight the impact of best matching on their operational performance, including service level, utilization, stability, and cost-effectiveness, and validate the computational merits of the developed solution methodologies
- …