Abstract: This study proposes Q-learning-based iterated greedy (IGQ) algorithms to solve the blocking flowshop scheduling problem with the makespan criterion. Q learning is a model-free machine intelligence technique, which is adapted into the traditional iterated greedy (IG) algorithm to determine its parameters, mainly, the destruction size and temperature scale factor, adaptively during the search process. Besides IGQ algorithms, two different mathematical modeling techniques. One of these techniques is the constraint programming (CP) model, which is known to work well with scheduling problems. The other technique is the mixed integer linear programming (MILP) model, which provides the mathematical definition of the problem. The introduction of these mathematical models supports the validation of IGQ algorithms and provides a comparison between different exact solution methodologies. To measure and compare the performance of IGQ algorithms and mathematical models, extensive computational experiments have been performed on both small and large VRF benchmarks available in the literature. Computational results and statistical analyses indicate that IGQ algorithms generate substantially better results when compared to non-learning IG algorithms.

	© 2010 by the authors; licensee Growing Science, Canada. This is an open access article distributed under the terms and conditions of the license. Creative Commons Attribution (CC-BY)

Abstract: The current paper investigates a two-stage flow shop scheduling model with no idle restriction, in which the time taken by machines to set-up is separately considered from the processing time. Owing to inherent usefulness as well as relevance in real-world situations, jobs' weight has additionally included. To eliminate machine idle time and cutting machine cost of rental, the reason for the conduct of the study is to provide a heuristic algorithm which, once put into practice, processes jobs in an optimal way, guarantees in smallest conceivable make span. Multiple computational examples generated in MATLAB 2019a serve as testament to the efficacy of the proposed strategy. The outcomes are contrasted with the current methods that Johnson, Palmer and NEH have demonstrated.

	© 2010 by the authors; licensee Growing Science, Canada. This is an open access article distributed under the terms and conditions of the license. Creative Commons Attribution (CC-BY)

Abstract: To better meet the qualitative and quantitative requirements of customers or relevant sector managers, workshop environments are implementing increasingly complex task management systems. The job shop scheduling problem (JSSP) involves assigning each task to a single machine while scheduling many tasks on different machines. Finding the best scheduling for machines is one of the challenging optimizations of difficult non-deterministic polynomial (NP) time problems. The fundamental goal of optimization is to shorten the makespan (total execution time of all tasks). This paper is interested in the joint resolution of scheduling and transport problems and more particularly the Job-shop problem with Routing (JSSPR) as opposed to the Job-shop problem with Transport (JSSPT). These two problems are modeled in the form of a disjunctive graph. For the JSSPT, the solution to the transport problem is not linked to any quality of service (QoS) criterion and the solution is therefore often semi-active. The Job-shop with Routing explicitly considers transport operations and uses algorithms from the transport community to solve the transport problem. It is shown that the routing part of the JSSPR is a problem of the vehicle routing family and of the Pickup and Delivery Problem family. QoS in the JSSPR is defined by the duration of tours, the duration of transport of parts and the waiting time for them. A new evaluation function – named Time-Lag Insertion Heuristic (TLH) – is proposed to evaluate a disjunctive graph by simultaneously minimizing the makespan and maximizing the quality of service. Thus, the solution obtained is not semi-active, but a compromise between the different criteria. This evaluation function is included in a metaheuristic. Our numerical evaluations demonstrate that, on the one hand, the TLH evaluation can find almost optimal solutions regarding the QoS criterion; and on the other hand, the TLH evaluation is not very sensitive to the order of insertion of the maximum time-lags during the different minimization steps.

	© 2010 by the authors; licensee Growing Science, Canada. This is an open access article distributed under the terms and conditions of the license. Creative Commons Attribution (CC-BY)

Abstract: Digital transformation is a challenge that also impacts the selection of tools for implementing projects. Which tools are suitable for handling complex digital twins? Project management must respond to this with suitable approaches. The challenge for decision-makers is to choose the right one. Based on literature research and a case study, influencing factors are derived and practice-relevant project management approaches are collected. Furthermore, a decision model is developed that, on the one hand, supports the decision-maker in selecting tools before and during the project, and on the other hand makes empirical values from past projects usable for future decisions. The results show that the number of influencing factors is large, and the approaches are di-verse. In complex projects, this can lead to complex decision-making situations that require appropriate decision models. The developed “Supervised Decision Model – L5” is based on five levels (L): (L1) Building a database; (L2) Derivation of algorithms; (L3) Initial approach selection; (L4) Review of the initial selection; (L5) Using experiences for future decisions. In practice it turns out that complex projects – like Digital Twins - often fail. Modified decision models for selecting suitable approaches should therefore take the following as-pects into account: (a) decision-makers are actively supported in the initial decision phase; (b) initial decisions once made are checked in the early phase of the project and corrected if necessary; (c) the lessons learned are recorded in the database as empirical value and used for future decisions.

	© 2010 by the authors; licensee Growing Science, Canada. This is an open access article distributed under the terms and conditions of the license. Creative Commons Attribution (CC-BY)

Abstract: Operating rooms (OR) are one of the most expensive parts of a hospital with complex processes, and the efficient use of resources is of utmost importance. Therefore, proper management and operation of operating rooms are extremely crucial. OR scheduling ensures that the surgeries are performed at the proper time, patients are treated effectively and safely, resources are used effectively, and staff is increased in work efficiency. Furthermore, accurately scheduled surgeries are safer for patients' healing processes. This is dependent on factors such as the availability of qualified personnel at the appropriate time, the readiness of surgical equipment, and the provision of proper sterilization and hygienic conditions. Surgical team scheduling ensures that surgeries begin on time, are completed effectively, and patients are treated safely. It is also critical to reduce employee fatigue and balance the workload. As a result, integrating surgical teams into operating room scheduling problems provides significant benefits. Accordingly, 29 research articles focusing on the problem of OR scheduling, within the scope of constraints on surgical team members, scheduling strategies, uncertainties, and solution methods, are thoroughly reviewed in this study.

	© 2010 by the authors; licensee Growing Science, Canada. This is an open access article distributed under the terms and conditions of the license. Creative Commons Attribution (CC-BY)