This research introduces a comprehensive scheme to tackle the Mixed-Model Assembly Line Balancing Problem (MALBPLW) within manufacturing contexts. The primary aim is to optimize assembly line task assignments by integrating both the learning effect and worker prerequisites. The learning effect recognizes the enhanced efficiency of workers over time due to learning and experience. A novel mathematical model and solution approach are proposed, encompassing factors like cycle time, task interdependencies, worker classifications, and the learning effect. The model endeavors to minimize the overall costs related to both workers and workstations while simultaneously maximizing production efficiency. Experimental assessments are conducted to evaluate the efficacy of this proposed approach. Diverse manufacturing scenarios are inspected, comparing and analyzing cost reductions and production efficiency. The outcomes highlight the effectiveness of this approach in achieving enhanced cost-effectiveness and resource utilization in contrast to conventional methods. This study contributes significantly to advancing assembly line balancing and production planning techniques by presenting a pragmatic framework for optimizing resource usage and reducing costs in manufacturing environments. The knowledge extracted from these discoveries can significantly assist professionals in the industry seeking to improve manufacturing processes and strengthen competitiveness.

Maximising the patient flows throughout the emergency care patient pathway is one of the most important objectives in the healthcare system. The emergency department (ED) is the critical point of this pathway in most hospitals, as the potential delays reduce the number of patients seen in the recommended time. One of the key delays in the ED is the waiting time of a patient prior to treatment, which can be reduced by optimising the patient treatment schedules with priorities. In this paper, a novel blocking patient flow (BPF) algorithm is developed and tested using the real data from a hospital in Brisbane, Australia. Initially, a simulation model of real-life ED operations is developed by characterising patient interarrival and treatment times according to different disease categories. Subsequently, a BPF heuristic algorithm is designed and benchmarked via computational experiments using two dominance rules: first come first served (FCFS) and shortest processing time (SPT). The computational results show that the proposed approach leads to a reduction of the total waiting time by more than 8 % in comparison to the current hospital practice, which implies that more patients will be served in a specified time window.

This paper proposes a new hybrid algorithm to solve the multi-compartment vehicle routing problem (MCVRP) with a heterogeneous fleet of vehicles for the fuel delivery problem of a previous study of twenty petrol stations in northeastern Thailand. The proposed heuristic is called the Fisher and Jaikumar Algorithm with Adaptive Large Neighborhood Search (FJA-ALNS algorithm). The objective of this case is to minimize the total distance, while using a minimum number of multi-compartment vehicles. In the first phase, we used the FJA to solve the MCVRP for the fuel delivery problem. The results from solving the FJA were utilized to be the initial solutions in the second phase. In the second phase, a hybrid algorithm, namely the FJA-ALNS algorithm, has been developed to improve the initial solutions of the individual FJA. The results from the FJA-ALNS algorithm are compared with the exact method (LINGO software), individual FJA and individual ALNS. For small-sized problems (N=5), the results of the proposed FJA-ALNS and all methods provided no different results from the global optimal solution, but the proposed FJA-ALNS algorithm required less computational time. For larger-sized problems, LINGO software could not find the optimal solution within the limited period of computational time, while the FJA-ALNS algorithm provided better results with much less computational time. In solving the four numerical examples using the FJA-ALNS algorithm, the result shows that the proposed FJA-ALNS algorithm is effective for solving the MCVRP in this case. Undoubtedly, future work can apply the proposed FJA-ALNS algorithm to other practical cases and other variants of the VRP in real-world situations.

Flow shop scheduling problems with rudimentary criteria of minimum makespan are the most important investigated problems in the field of scheduling. Generally during the process of generating an optimal sequence, multiple partial sequences claiming the optimal value of makespan are observed. In this paper a novel tie-breaking rule to select one of the best optimal sequences out of all possible partial sequences is developed which then applied to Nawaz-Enscore-Ham (NEH) heuristic to solve the scheduling problems in permutation flowshop without increasing the computational complexity. The performance of proposed heuristic is tested with other existing tie-breaking heuristics of similar complexity over Taillard and VRF's instances. Computational results reveal that in terms of solution quality, the proposed heuristic outperforms over the other NEH based heuristics of the same complexity reported in literature.

In recent years, many studies on scheduling problems with dedicated machines have been carried out. But, few of them have considered the case of more than two stages. This paper aims at filling this gap by addressing the three-stage hybrid flow shop scheduling problem with two dedicated machines in stage 3. Each job must be processed, consecutively, on the single machines of stages 1 and 2, and depending on its type, it will be further processed on one of the two dedicated machines of stage 3. The objective is to find an optimal schedule that minimizes the maximum completion time (makespan). Since this problem is strongly NP-hard, we first provide some basic results including solutions for several variations of the problem. Then, for the general case we adapt a set of lower bounds from the literature and propose a heuristic approach that is based on the dynamic programming technique, which uses a local search procedure. Finally, various experimentations on several problems with different sizes are conducted and the computational results of the heuristic show that the mean percentage deviation value from the lower bound was lower than 0.8 percent for some instances with 40 to 200 jobs in size.

Distribution of goods is one of the main issues that directly affect the performance of the companies since efficient distribution of goods saves energy costs and also leads to reduced environmental impact. The multi-compartment vehicle routing problem (MCVRP) with a heterogeneous fleet of vehicles is encountered when dealing with this situation in many practical cases. This paper is motivated by the fuel delivery problem where the main objective of this research is to minimize the total driving distance using a minimum number of vehicles. Based on a case study of twenty petrol stations in northeastern Thailand, a novel two-phase heuristic, which is a variant of the Fisher and Jaikumar Algorithm (FJA), is proposed. The study first formulates an MCVRP model and then a mixed-integer linear programming (MILP) model is formulated for selecting the numbers and types of vehicles. A new clustering-based model is also developed in order to select the seed nodes and all customer nodes are considered as candidate seed nodes. The new Generalized Assignment Problem model (GAP model) is formulated to allocate the customers into each cluster. Finally, based on the traveling salesman problem (TSP), each cluster is solved in order to minimize the total driving distance. Numerical results show that the proposed heuristic is effective for solving the proposed model. The proposed algorithm can be used to minimize the total driving distance and the number of vehicles of the distribution network for fuel delivery.

No-wait flow shop scheduling refers to continuous flow of jobs through different machines. The job once started should have the continuous processing through the machines without wait. This situation occurs when there is a lack of an intermediate storage between the processing of jobs on two consecutive machines. The problem of no-wait with the objective of minimizing makespan in flow shop scheduling is NP-hard; therefore the heuristic algorithms are the key to solve the problem with optimal solution or to approach nearer to optimal solution in simple manner. The paper describes two heuristics, one constructive and an improvement heuristic algorithm obtained by modifying the constructive one for sequencing n-jobs through m-machines in a flow shop under no-wait constraint with the objective of minimizing makespan. The efficiency of the proposed heuristic algorithms is tested on 120 Taillard’s benchmark problems found in the literature against the NEH under no-wait and the MNEH heuristic for no-wait flow shop problem. The improvement heuristic outperforms all heuristics on the Taillard’s instances by improving the results of NEH by 27.85%, MNEH by 22.56% and that of the proposed constructive heuristic algorithm by 24.68%. To explain the computational process of the proposed algorithm, numerical illustrations are also given in the paper. Statistical tests of significance are done in order to draw the conclusions.

Facility location models are observed in many diverse areas such as communication networks, transportation, and distribution systems planning. They play significant role in supply chain and operations management and are one of the main well-known topics in strategic agenda of contemporary manufacturing and service companies accompanied by long-lasting effects. We define a new approach for solving stochastic single source capacitated facility location problem (SSSCFLP). Customers with stochastic demand are assigned to set of capacitated facilities that are selected to serve them. It is demonstrated that problem can be transformed to deterministic Single Source Capacitated Facility Location Problem (SSCFLP) for Poisson demand distribution. A hybrid algorithm which combines Lagrangian heuristic with adjusted mixture of Ant colony and Genetic optimization is proposed to find lower and upper bounds for this problem. Computational results of various instances with distinct properties indicate that proposed solving approach is efficient.

Job shop has been considered as one of the most challenging scheduling problems and there are literally tremendous efforts on reducing the complexity of solution procedure for solving job shop problem. This paper presents a heuristic method to minimize makespan for different jobs in a job shop scheduling. The proposed model is based on a constructive procedure to obtain good quality schedules, very quickly. The performance of the proposed model of this paper is examined on standard benchmarks from the literature in order to evaluate its performance. Computational results show that, despite its simplicity, the proposed heuristic is computationally efficient and practical approach for the problem.