A declarative decision support framework for scheduling groups of orders (original) (raw)
Related papers
Flexibility of scheduling tools for order production problems
Computer Integrated Manufacturing Systems, 1993
A fundamental issue in scheduling tools for order production systems is the trade-off between the feasibility of a solution with respect to a set of dynamic local constraints and the evaluation of a schedule with respect to different global optimality criteria. CIM managers clamour for more flexible and easy to handle tools than those provided by classical scheduling theory. Decision Support Systems (DSS) have been proved to be valuable tools for manipulating schedules and for managing information on the production process. This paper surveys previous work on scheduling in production systems, and presents a methodology for facing production scheduling problems. New design criteria and interactive models for effectively supporting the methodology in flexible and dynamic production environments are discussed.
A Declarative Approach to Shop Orders Optimization
Applied Computer Science
The paper presents the problem of material requirements planning with optimization of load distribution between work centers and workers’ groups. Moreover, it discusses the computational example for shop orders optimization. The data for this example were taken from the relational database. The method of Constraint Logic Programming (CLP) for shop orders optimization has been suggested. Using Constraint Logic Programming, the constraints may be directly introduced to the problem declaration, which is equivalent to the source code of the program. The ECLiPSe-CLP software system has been presented. It allows for solving optimization problems concerning dimensions greater than in the case of the professional mathematical programming solver “LINGO”. The application of ECLiPSe-CLP in accessing data from relational databases has been presented.
Scheduling problems — An overview
Journal of Systems Science and Systems Engineering, 2003
There seems to be a significant gap between the theoretical and the practical aspects of scheduling problems in the job shop environment. Theoretically, scheduling systems are designed on the basis of an optimum approach to the scheduling model. However in the practice, the optimum that is built into the scheduling applications seems to face some challenges when dealing with the dynamic character of a scheduling system, for instance machine breakdown or change of orders. Scheduling systems have become quite complex in the past few years. Competitive business environments and shorter product life cycles are the imminent challenges being faced by many companies these days. These challenges push companies to anticipate a demand driven supply chain in their business environment. A demand-driven supply chain incorporates the customer view into the supply chain processes. As a consequence of this, scheduling as a core process of the demand-driven supply chain must also reflect the customer view. In addition, other approaches to solving scheduling problems, for instance approaches based on human factors, prefer the scheduling system to be more flexible in both design and implementation. After discussion of these factors, the authors propose the integration of a different set of criteria for the development of scheduling systems which not only appears to have a better flexibility but also increased customer-focus.
Towards Dedicated Decision Support Tools: CLP-Based Approach
2016
Constraint programming (CP) is an emergent software technology for declarative description and effective solving of large combinatorial problems especially in areas of integrated production planning. In that context, the CP can be considered as a well-suited framework for development of decision making software supporting small and medium size enterprises in the course of Production Process Planning (PPP). The problem considered regards of finding of computationally effective approach aimed at scheduling of a new project subject to constraints imposed by a multi–project environment. In other words, we are looking for an answer whether a given production order specified by its cost and completion time can be accepted in a given manufacturing system specified by available production capability, i.e., the time-constrained resources availability. The problem belongs to a class of multi-mode case project scheduling problems, where the problem of finding a feasible solution is NP-complete...
A decision‐support system for scheduling in a customer‐oriented manufacturing environment
Integrated Manufacturing Systems, 1996
An intelligent decision‐support system was designed for assessing schedulability prior to assigning parts for scheduling. This was designed as part of a larger system for intelligent, real‐time control of a manufacturing system operation, where one of the system objectives was just‐in‐time delivery of production output. The manufacturing system was a conventional cellular manufacturing system where machines were assumed occasionally to fail. All necessary requirements for the processing of a job should actually or anticipatively be satisfied before a job is scheduled. The decision‐support system attempts to satisfy these requirements. The system thus helps the decision maker to make the right decision when system and customer constraints are violated. Illustrates the operation of the system through an example.
Constraint logic programming and scheduling problems
1996 IEEE International Conference on Systems, Man and Cybernetics. Information Intelligence and Systems (Cat. No.96CH35929)
Classical approaches f o r the resolution of combinatorial problems are of two kinds: exact methods or approximate ones. Scheduling problems enter in this framework. Up to now, Operational Research tools were proposed to consider such problems. Recently, new resolution methods were developped. This is the case for the familly of stochastic methods or genetic algorithms. But, real life problem that come from the industrial environment require more jlexible tools. This is the purpose of Constraint Logic Programming approach. It allows one to ally versatility and eficiency. We will show in this paper, why this new generation of tools seems to be interesting for solving scheduling problems.
Design of Scheduling Algorithms
Behavioral Operations in Planning and Scheduling, 2010
The academic field of production research has been growing rapidly over the last decades with researchers proposing numerous analytical and heuristic optimization methodologies for the solution of planning & scheduling problems. However, adaption by manufacturing companies is lagging behind. This paper suggests that the basic reason behind this imbalance is the inadequate representation of the planning & scheduling process when designing decision support systems. Hence, the algorithms that are designed and included in these systems might not reflect the problems that actually have to be solved in practice. In this paper we discuss the basic factors that are important for the development of planning & scheduling decision support systems. These factors will be based on insights from cognitive psychology, computer science, and operations management.
A decision support system for operational production scheduling
European Journal of Operational Research, 1991
In this paper we describe a Decision Support System for dynamic job shop scheduling environments. The supported decision situation includes several real-life features which are disregarded by conventional scheduling models. The system supports the planner in constructing efficient and effective schedules. The efficiency is guaranteed by algorithmic procedures and the effectiveness by interactive manipulation techniques. The due date achievement is the objective of the algorithmic support, but other objectives can be achieved by means of the control functions which allow the user to direct the decision process.
2011
Usually, business process models are manually achieved by business analysts and most of current modelling languages are of imperative nature. As a consequence, non-optimized or faulty models can be obtained. This work proposes a planning based approach to give business analysts assistance for the process models generation. This approach entails the selection and the order of the activities to be executed (planning), and the resources allocation involving temporal reasoning (scheduling), both considering function optimization. The process information is specified in a declarative way, that is translated into the standard planning language PDDL. A friendly graphic language is used (ConDec-R, an extension of ConDec).