4,867 research outputs found
Parameterized complexity of machine scheduling: 15 open problems
Machine scheduling problems are a long-time key domain of algorithms and
complexity research. A novel approach to machine scheduling problems are
fixed-parameter algorithms. To stimulate this thriving research direction, we
propose 15 open questions in this area whose resolution we expect to lead to
the discovery of new approaches and techniques both in scheduling and
parameterized complexity theory.Comment: Version accepted to Computers & Operations Researc
Working Notes from the 1992 AAAI Spring Symposium on Practical Approaches to Scheduling and Planning
The symposium presented issues involved in the development of scheduling systems that can deal with resource and time limitations. To qualify, a system must be implemented and tested to some degree on non-trivial problems (ideally, on real-world problems). However, a system need not be fully deployed to qualify. Systems that schedule actions in terms of metric time constraints typically represent and reason about an external numeric clock or calendar and can be contrasted with those systems that represent time purely symbolically. The following topics are discussed: integrating planning and scheduling; integrating symbolic goals and numerical utilities; managing uncertainty; incremental rescheduling; managing limited computation time; anytime scheduling and planning algorithms, systems; dependency analysis and schedule reuse; management of schedule and plan execution; and incorporation of discrete event techniques
Application of Reinforcement Learning to Multi-Agent Production Scheduling
Reinforcement learning (RL) has received attention in recent years from agent-based researchers because it can be applied to problems where autonomous agents learn to select proper actions for achieving their goals based on interactions with their environment. Each time an agent performs an action, the environment¡Šs response, as indicated by its new state, is used by the agent to reward or penalize its action. The agent¡Šs goal is to maximize the total amount of reward it receives over the long run. Although there have been several successful examples demonstrating the usefulness of RL, its application to manufacturing systems has not been fully explored. The objective of this research is to develop a set of guidelines for applying the Q-learning algorithm to enable an individual agent to develop a decision making policy for use in agent-based production scheduling applications such as dispatching rule selection and job routing. For the dispatching rule selection problem, a single machine agent employs the Q-learning algorithm to develop a decision-making policy on selecting the appropriate dispatching rule from among three given dispatching rules. In the job routing problem, a simulated job shop system is used for examining the implementation of the Q-learning algorithm for use by job agents when making routing decisions in such an environment. Two factorial experiment designs for studying the settings used to apply Q-learning to the single machine dispatching rule selection problem and the job routing problem are carried out. This study not only investigates the main effects of this Q-learning application but also provides recommendations for factor settings and useful guidelines for future applications of Q-learning to agent-based production scheduling
Methods and Techniques Used for Job Shop Scheduling
The job shop scheduling problem, in which we must determine the order or sequence for processing a set of jobs through several machines in an optimum manner, has received considerable attention. In this paper a number of the methods and techniques are reviewed and an attempt to categorize them according to their appropriateness for effective use in job shop scheduling has been made. Approaches are classified in two categories: a) analytical techniques and b) graphical methods. Also, it should be noticed that this report does not include all the attempts and trials, especially the heuristic approaches
Recommended from our members
Three Essays on Data-Driven Optimization for Scheduling in Manufacturing and Healthcare
This dissertation consists of three essays on data-driven optimization for scheduling in manufacturing and healthcare. In Chapter 1, we briefly introduce the optimization problems tackled in these essays. The first of these essays deals with machine scheduling problems. In Chapter 2, we compare the effectiveness of direct positional variables against relative positional variables computationally in a variety of machine scheduling problems and we present our results. The second essay deals with a scheduling problem in healthcare: the team primary care practice. In Chapter 3, we build upon the two-stage stochastic integer programming model introduced by Alvarez Oh (2015) to solve this challenging scheduling problem of determining patient appointment times to minimize a weighted combination of patient wait and provider idle times for the team practice. To overcome the computational complexity associated with solving the problem under the large set of scenarios required to accurately capture uncertainty in this setting, our approach relies on a lower bounding technique based on solving an exhaustive and mutually exclusive group of scenario subsets. Our computational results identify the structure of optimal schedules and quantify the impact of nurse flexibility, patient crossovers and no-shows. We conclude with practical scheduling guidelines for team primary care practices. The third essay deals with another scheduling problem observed in a manufacturing setting similar to first essay, this time in aerospace industry. In Chapter 4, we propose mathematical models to optimize scheduling at a tactical and operational level in a job shop at an aerospace parts manufacturer and implement our methods using real-life data collected from this company. We generalize the Multi-Level Capacitated Lot-Sizing Problem (MLCLSP) from the literature and use novel computational techniques that depend on the data structure observed to reduce the size of the problem and solve realistically-sized instances in this chapter. We also provide a sensitivity analysis of different modeling techniques and objective functions using key performance indicators (KPIs) important for the manufacturer. Chapter 5 proposes extensions of models and techniques that are introduced in Chapters 2, 3 and 4 and outlines future research directions. Chapter 6 summarizes our findings and concludes the dissertation
Shop floor planning and control in integrated manufacturing systems
The implementation of a shop floor planning and control system is a prerequisite in establishing an effective computer integrated manufacturing system. A shop floor control system integrates management production goals with the capabilities and limitations of the manufacturing plant. Shop floor planning begins with a long term rough cut capacity plan and evolves into near term, capacity requirements and input/output plans. Shop floor control provides a status of in-process operations and a measure of the plants success in executing the plan. Effective use of technology on shop floor increases the efficiency of the manufacturing plant. Simulation is an important tools in accomplishing this. The use of simulation for planning and control of shop floor activities is a natural out growth of its application for the design of systems. Simulation, when used for production planning and control, is a useful vehicle for providing the discipline necessary for effective shop floor control in integrated manufacturing systems
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
- …