7 research outputs found
Design of a Reference Architecture for Production Scheduling Applications based on a Problem Representation including Practical Constraints
Changing customer demands increase the complexity and importance of production scheduling, requiring better scheduling algorithms, e.g., machine learning algorithms. At the same time, current research often neglects practical constraints, e.g., changeovers or transportation. To address this issue, we derive a representation of the scheduling problem and develop a reference architecture for future scheduling applications to increase the impact of future research. To achieve this goal, we apply a design science research approach and, first, rigorously identify the problem and derive requirements for a scheduling application based on a structured literature review. Then, we develop the problem representation and reference architecture as design science artifacts. Finally, we demonstrate the artifacts in an application scenario and publish the resulting prototypical scheduling application, enabling machine learning-based scheduling algorithms, for usage in future development projects. Our results guide future research into including practical constraints and provide practitioners with a framework for developing scheduling applications
Job Shop Scheduling with Routing Flexibility and Sequence-Dependent Setup Times
This paper presents a meta-heuristic algorithm for solving a job shop scheduling problem involving both sequence dependent setup-times and the possibility of selecting alternative routes among the available machines. The proposed strategy is a variant of the Iterative Flattening Search (IFS ) schema. This work provides three separate results: (1) a constraint-based solving procedure that extends an existing approach for classical Job Shop Scheduling; (2) a new variable and value ordering heuristic based on temporal flexibility that take into account both sequence dependent setup-times and flexibility in machine selection; (3) an original relaxation strategy based on the idea of randomly breaking the execution orders of the activities on the machines with a activity selection criteria based on their proximity to the solution\u27s critical path. The efficacy of the overall heuristic optimization algorithm is demonstrated on a new benchmark set which is an extension of a well-known and difficult benchmark for the Flexible Job Shop Scheduling Problem
Lateness minimization with Tabu search for job shop scheduling problem with sequence dependent setup times
We tackle the job shop scheduling problem with sequence dependent setup times and maximum lateness minimization by means of a tabu search algorithm. We start by defining a disjunctive model for this problem, which allows us to study some properties of the problem. Using these properties we define a new local search neighborhood structure, which is then incorporated into the proposed tabu search algorithm. To assess the performance of this algorithm, we present the results of an extensive experimental study, including an analysis of the tabu search algorithm under different running conditions and a comparison with the state-of-the-art algorithms. The experiments are performed across two sets of conventional benchmarks with 960 and 17 instances respectively. The results demonstrate that the proposed tabu search algorithm is superior to the state-of-the-art methods both in quality and stability. In particular, our algorithm establishes new best solutions for 817 of the 960 instances of the first set and reaches the best known solutions in 16 of the 17 instances of the second se
Neighborhood structures for scheduling problems with additional resource types
The job shop scheduling is a challenging problem that has interested to researchers in the fields of Artificial Intelligence and Metaheuristics over the last decades. In this project, we face the job shop scheduling problem with an additional resource type (operators). This is a variant of the problem, which has been proposed recently in the literature. We start from a genetic algorithm that has been proposed previously to solve this problem and improve it in two different ways. Firstly, we introduce a modification in the schedule generation scheme in order to control the time of inactivity of the machines. Secondly we define a number of neighbourhood structures that are then incorporated in a memetic algorithm. In order to evaluate the proposed strategies, we have conducted an experimental study across a benchmark derived from a set of hard instances of the classic job shop problem
Evolutionary algorithms for scheduling operations
While business process automation is proliferating through industries and processes, operations such as job and crew scheduling are still performed manually in the majority of workplaces. The linear programming techniques are
not capable of automated production of a job or crew schedule within a reasonable computation time due to the massive sizes of real-life scheduling problems. For this reason, AI solutions are becoming increasingly popular,
specifically Evolutionary Algorithms (EAs).
However, there are three key limitations of previous studies researching application of EAs for the solution of the scheduling problems. First of all, there is no justification for the selection of a particular genetic operator and conclusion about their effectiveness. Secondly, the practical efficiency of such algorithms is
unknown due to the lack of comparison with manually produced schedules.
Finally, the implications of real-life implementation of the algorithm are rarely considered. This research aims at addressing all three limitations. Collaborations with DBSchenker,the rail freight carrier, and Garnett-Dickinson, the printing company,have been established. Multi-disciplinary research methods including document
analysis, focus group evaluations, and interviews with managers from different levels have been carried out. A standard EA has been enhanced with developed within research intelligent operators to efficiently solve the problems. Assessment of the developed algorithm in the context of real life crew scheduling problem showed that the automated schedule outperformed the manual one by
3.7% in terms of its operating efficiency. In addition, the automatically produced schedule required less staff to complete all the jobs and might provide an additional revenue opportunity of £500 000.
The research has also revealed a positive attitude expressed by the operational and IT managers towards the developed system. Investment analysis demonstrated a 41% return rate on investment in the automated scheduling
system, while the strategic analysis suggests that this system can enable attainment of strategic priorities. The end users of the system, on the other hand,
expressed some degree of scepticism and would prefer manual methods
Recommended from our members
The scheduling of manufacturing systems using Artificial Intelligence (AI) techniques in order to find optimal/near-optimal solutions.
This thesis aims to review and analyze the scheduling problem in general and Job Shop Scheduling Problem (JSSP) in particular and the solution techniques applied to these problems. The JSSP is the most general and popular hard combinational optimization problem in manufacturing systems. For the past sixty years, an enormous amount of research has been carried out to solve these problems. The literature review showed the inherent shortcomings of solutions to scheduling problems. This has directed researchers to develop hybrid approaches, as no single technique for scheduling has yet been successful in providing optimal solutions to these difficult problems, with much potential for improvements in the existing techniques.
The hybrid approach complements and compensates for the limitations of each individual solution technique for better performance and improves results in solving both static and dynamic production scheduling environments. Over the past years, hybrid approaches have generally outperformed simple Genetic Algorithms (GAs). Therefore, two novel priority heuristic rules are developed: Index Based Heuristic and Hybrid Heuristic. These rules are applied to benchmark JSSP and compared with popular traditional rules. The results show that these new heuristic rules have outperformed the traditional heuristic rules over a wide range of benchmark JSSPs. Furthermore, a hybrid GA is developed as an alternate scheduling approach. The hybrid GA uses the novel heuristic rules in its key steps. The hybrid GA is applied to benchmark JSSPs. The hybrid GA is also tested on benchmark flow shop scheduling problems and industrial case studies. The hybrid GA successfully found solutions to JSSPs and is not problem dependent. The hybrid GA performance across the case studies has proved that the developed scheduling model can be applied to any real-world scheduling problem for achieving optimal or near-optimal solutions. This shows the effectiveness of the hybrid GA in real-world scheduling problems.
In conclusion, all the research objectives are achieved. Finaly, the future work for the developed heuristic rules and the hybrid GA are discussed and recommendations are made on the basis of the results.Board of Trustees, Endowment Fund Project, KPK University of Engineering and Technology (UET), Peshawar and Higher Education Commission (HEC), Pakista