---

Nowadays, several methods in production management mainly focus on the different partners of supply chain management. In real world, the capacity of planes is limited. In addition, the recent decade has seen the rapid development of controlling the uncertainty in the production scheduling configurations along with proposing novel solution approaches. This paper proposes a new mathematical model via strong recent meta-heuristics planning. This study firstly develops and coordinates the integrated air transportation and production scheduling problem with time windows and due date time in Fuzzy environment to minimize the total cost. Since the problem is NP-hard, we use four meta-heuristics along with some new procedures and operators to solve the problem. The algorithms are divided into two groups: traditional and recent ones. Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) as traditional algorithms, also Keshtel Algorithm (KA) and Virus Colony Search (VCS) as the recent ones are utilized in this study. In addition, by using Taguchi experimental design, the algorithm parameters are tuned. Besides, to study the behavior of the algorithms, different problem sizes are generated and the results are compared and discussed.

---

Surgical theater is one of the most expensive hospital sources that a high percentage of hospital admissions are related to it. Therefore, efficient planning and scheduling of the operating rooms (ORs) is necessary to improve the efficiency of any healthcare system. Therefore, in this paper, the weekly OR planning and scheduling problem is addressed to minimize the waiting time of elective patients, overutilization and underutilization costs of ORs and the total completion time of surgeries. We take into account the available hours of ORs and the surgeons, legal constraints and job qualification of surgeons, and priority of patients in the model. A real-life example is provided to demonstrate the effectiveness and applicability of the model and is solved using ε-constraint method in GAMS software. Then, data envelopment analysis (DEA) is employed to obtain the best solution among the Pareto solutions obtained by ε-constraint method. Finally, the best Pareto solution is compared to the schedule used in the hospitals. The results indicate the best Pareto solution outperforms the schedule offered by the OR director.

---

The Multi-Mode Resource Constrained Project Scheduling Problem (MMRCPSP) is one of the most important problems in project scheduling context. The MMRCPSP consists of activities to be scheduled subject to precedence and resource constraints. The effort needed in order to accomplish activities in the MMRCPSP is a discrete function of job performing modes. However, MMRCPSP is a basic model with a rather too restrictive assumptions to be applied practically. Therefore, there are many extensions over basic MMRCPSP model in terms of objective functions, resource constraints, and solving procedures. This research is aiming at fulfilling tow ambitions. First, to collect researches related MMRCPSP and to classify them based on a framework consisting of six distinct classes. Second, to indicate current trends and potential areas of future research. In order to fulfill the second goal a new mathematical method is proposed and applied which identify recent trends and gaps in a systematic manner.
 

---

Project scheduling problem with resources constraint is a well-known problem in the field of project management. The applicable nature of this problem has caused the researchers’ tendency to it. In this study, project scheduling with resource constraints and the possibility of interruption of project activities as well as renewable resources constraint has been also applied along with a case study on construction projects. Construction projects involve complex levels of work. Making wrong decisions in selecting methods and how to allocate the necessary resources such as manpower and equipment can lead to the results such as increasing the predetermined cost and time. According to NP-Hard nature of the problem, it is very difficult or even impossible to obtain optimal solution using optimization software and traditional methods. In project scheduling using CPM method, critical path is widely used; however, in this method, the resource constraints is not considered. Project Scheduling seek proper sequence for doing the project activities. This study has been conducted using Bees meta-heuristic algorithm, with the aim of optimizing the project completion time. Finally, the results obtained from three algorithms and GAMS software shows that this algorithm has better performance than and the solution among the other algorithms and has achieved the accurate solutions.

---

This paper focused on scheduling problems arising in a two-machine, identical parts robotic cell configured in a flow shop. Through current research, a mathematical programming model on minimizing cycle time as well operational cost, considering availability of robotic cell as a constraint, is proposed to search for the optimum allocation and schedule of operations to these two machines. Two solution procedures, including weighted sum method and ∊-constraint method are provided. Based on the weighted sum method, like some previous studies, sensitivity analysis on model parameters were done and the optimum solutions were compared with previous results, while the ∊-constraint method can find the Pareto optimal solutions for problems with up to 18 operations in a reasonable time.

---

We study the problem of order acceptance, scheduling and pricing (OASP) in parallel machine environment. Each order is characterized by due date, release date, deadline, controllable processing time, sequence dependent set up time and price in MTO system. We present a MILP formulation to maximize the net profit. Then under joint optimization approach, the pricing decisions set for unrelated parallel machine environment. The results show that the basic developed problem can solve the scheduling decisions based on different levels of products’ priced. Thus the problem solves these two categories of decisions simultaneously. Moreover, the changes of accepted orders in pricing levels can be analyzed regarding its dependency to price elasticity of items for future research.

---

 Sequence dependent set-up times scheduling problems (SDSTs), availability constraint and transportation times are interesting and important issues in production management, which are often addressed separately. In this paper, the SDSTs job shop scheduling problem with position-based learning effects, job-dependent transportation times and multiple preventive maintenance activities is studied. Due to learning effects, jobs processing times are not fixed during plan horizon and each machine has predetermined number of preventive maintenance activities. A novel mixed integer linear programming model is proposed to formulate the problem for minimizing Make Span. Owing to the high complexity of the problem; we applied Grey Wolf Optimizer (GWO) and Invasive Weed Optimizer (IWO) to find nearly optimal solutions for medium and large instances. Finally, the computational Results are provided for evaluating the performance and effectiveness of the proposed solution approaches.

---

The present work addresses inventory-routing rescheduling problem (IRRP) that is needed when some minor changes happen in the time of execution of pre-planned scheduling of an inventory-routing problem (IRP). Due to the complexity of the process of departing from one pre-planned scheduling IRP to a rescheduling IRP, here a decision-support tool is devised to help the decision-maker. This complexity comes from the issue that changes in an agreed schedule including the used capacity of the vehicle, total distance and other factors that need a re-agreements negotiation which directly relates to the agreed costs especially when a carrier contractor is responsible for the distribution of goods between customers. From one side he wants to stick to the pre-planned scheduling and from the other side, changes in predicted data of problem at the time of execution need a new optimized solution. The proposed approached applies mathematical modeling for optimizing the rescheduled problem and offers a sensitivity analysis to study the influence of the different adjustment of variables (carried load, distance, …). 

---

---

Project scheduling is one of the most important and applicable concepts of project management. Many project-oriented companies and organizations apply variable cost reduction strategies in project implementation. Considering the current business environments, in addition to lowering their costs, many companies seek to prevent project delays. This paper presents a multi-objective fuzzy mathematical model for the problem of project scheduling with the limitation of multi-skilled resources able to change skills levels, optimizing project scheduling policy and skills recruitment. Given the multi objectivity of the model, the goal programming approach was used, and an equivalent single-objective model was obtained. Since the multi-skilled project scheduling is among the NP-Hard problems and the proposed problem is its extended state, so it is also an NP-Hard problem. Therefore, NSGA II and MOCS meta-heuristic algorithms were used to solve the large-sized model proposed using MATLAB software. The results show that the multi-objective genetic algorithm performs better than the multi-objective Cuckoo Search in the criteria of goal solution distance, spacing, and maximum performance enhancement.

---

This paper considers a customer order scheduling (COS) problem in which each customer requests a variety of products processed in a two-machine flow shop. A sequence-independent attached setup for each machine is needed before processing each product lot. We assume that customer orders are satisfied by the job-based processing approach in which the same products from different customer orders form a product lot (job). Each customer order for a product is processed as a sublot (a batch of identical items) of the product lot by applying the lot streaming (LS) idea in scheduling. We assume that all sublots of the same product must be processed together by the same machine without intermingling the sublots of other products. The completion time of a customer order is the completion time of the product processed as the last product in that order. All products in a customer order are delivered in a single shipment to the customer when the processing of all the products in that customer order is completed. We aim to find an optimal schedule with a product lots sequence and the sequence of the sublots in each job to minimize the sum of completion times of the customer orders. We have developed a mixed-integer linear programming (MILP) model and a multi-phase heuristic algorithm for solving the problem. The results of our computational experiments show that our model can solve the small-sized problem instances optimally. However, our heuristic algorithm finds optimal or near-optimal solutions for the medium- and large-sized problem instances in a short time.

---

Operating rooms have become the most important areas in hospitals because of the scarcity and cost of resources. The present study investigates operating room scheduling and rescheduling considering the priority of surgical patients in a specialized hospital. The ultimate purpose of scheduling is to minimize patient waiting time, surgeon idle time between surgeries, and penalties for deviations from operating room preferences. A mathematical programming model is presented to solve the problem. Because the problem is strongly NP-hard, two heuristic algorithms are presented. A heuristic algorithm based on a mathematical programming model with local search obtains near-optimal solutions for all the samples. The average relative deviation of this algorithm is 0.02%. In continuous, heuristic algorithms performance have been investigated by increasing the number of patients and reduce the number of recovery beds. Next, a rescheduling heuristic algorithm is presented to deal with real-time situations. This algorithm presents fewer changes resulting from rescheduling in comparison with the scheduling problem.

---

---

Given the increasing human need for health systems and the costs of using such systems, the problem of optimizing health-related systems has attracted the attention of many researchers. One of the most critical cases in this area is the operating room scheduling. Much of the cost of health systems is related to operating room costs. Therefore, planning and scheduling of operating rooms can play an essential role in increasing the efficiency of health systems as well as reducing costs. Given the uncertain factors involved in such matters, attention to uncertainty in this problem is one of the most critical factors in the results. In this study, the problem of the daily scheduling of the operating room with uncertain surgical time was investigated. For minimizing overhead costs and maximizing the number of surgeries to reduce patients' waiting time, after introducing a mathematical model, a chance-constrained programming approach is used to deal with its uncertainty. In this study, also, a harmony search algorithm is proposed to solve the model because of its NP-Hardness. By performing the numerical analysis and comparing the presented algorithm result with a genetic algorithm, the results show that the proposed algorithm has a better performance.

---

This paper presents a model for minimizing the makespan in the flow shop scheduling problem. Due to the impact of increased workloads, flow shops are becoming more popular and widely used in industries. To solve the challenge of minimizing makespan, a Hybrid-Heuristic-Metaheuristic-Genetic-Algorithm (HHMGA) is proposed. The proposed HHMGA algorithm is tested using the simulation software and demonstrated with steel industry data. The results are compared with those of the best available flow shop problem algorithms such as Palmer’s slope index, Campbell-Dudek-Smith (CDS), Nawaz-Enscore-Ham (NEH), genetic algorithm (GA) and particle swarm optimization (PSO). According to empirical results and relative differences from the lower bound, the proposed technique outperforms the three heuristics and two metaheuristics algorithms in three of six cases, while the remaining three produce the same results as the NEH heuristic. In comparison to the steel industry's regular job scheduling technique, the simulation model based on HHMGA can save 4642 hours. It was discovered that the suggested model enhanced the job sequence based on the makespan requirements.

---

---

---

---

---