A single machine batch processing problem with release dates to minimize the total completion time (1|rj,batch|Σ Cj ) is investigated in this research. An original mixed integer linear programming (MILP) model is proposed to optimally solve the problem. Since the research problem at hand is shown to be NP-hard, several different meta-heuristic algorithms based on tabu search (TS) and particle swarm optimization (PSO) are used to solve the problem. To find the most performing heuristic optimization technique, a set of test cases ranging in size (small, medium, and large) are randomly generated and solved by the proposed meta-heuristic algorithms. An extended comparison analysis is carried out and the outperformance of a hybrid meta-heuristic technique properly combining PSO and genetic algorithm (PSO-GA) is statistically demonstrated.

The wear of cutting tools remains a major obstacle. The effects of wear are not only antagonistic at the lifespan and productivity, but also harmful with the surface quality. The present work deals with some machinability studies on flank wear, surface roughness, and lifespan in finish turning of AISI 304 stainless steel using multilayer Ti(C,N)/Al2O3/TiN coated carbide inserts. The machining experiments are conducted based on the response surface methodology (RSM). Combined effects of three cutting parameters, namely cutting speed, feed rate and cutting time on the two performance outputs (i.e. VB and Ra), and combined effects of two cutting parameters, namely cutting speed and feed rate on lifespan (T), are explored employing the analysis of variance (ANOVA). The relationship between the variables and the technological parameters is determined using a quadratic regression model and optimal cutting conditions for each performance level are established through desirability function approach (DFA) optimization. The results show that the flank wear is influenced principally by the cutting time and in the second level by the cutting speed. In addition, it is indicated that the cutting time is the dominant factor affecting workpiece surface roughness followed by feed rate, while lifespan is influenced by cutting speed. The optimum level of input parameters for composite desirability was found Vc1-f1-t1 for VB, Ra and Vc1-f1 for T, with a maximum percentage of error 6.38%.

This paper focuses on the problem of scheduling and routing workers in a courier service to deliver packages for a set of geographically distributed customers and, on a specific date and time window. The crew of workers has a limited capacity and a time window that represents their labor length. The problem deals with a combination of multiples variants of the vehicle routing problem as capacity, multiple periods, time windows, due dates and distance as constraints. Since in the courier services the demands could be of hundreds or thousands of packages to be delivered, the problem is computationally unmanageable. We present a three-phase solution approach. In the first phase, a scheduling model determines the visit date for each customer in the planning horizon by considering the release date, due date to visit and travel times. We use an expert system based on the know-how of the courier service, which uses an inference engine that works as a rule interpreter. In the second phase, a clustering model assigns, for each period, customers to workers according to the travel times, maximum load capacity and customer’s time windows. We use a centroid based and sweep algorithms to solve the resulted problem. Finally, in the third phase, a routing model finds the order in which each worker will visit all customers taking into account their time windows and worker’s available time. To solve the routing problem we use an Ant Colony Optimization metaheuristic. We present some numerical results using a case study, in which the proposed method of this paper finds better results in comparison with the current method used in the case study.

This paper studies the problem of scheduling a finite set of customers with stochastic service times for a single-server system. The objective is to minimize the waiting time of customers, the idle time of the server, and the lateness of the schedule. Because of the NP-hardness of the problem, the optimal schedule is notoriously hard to derive with reasonable computation times. Therefore, we develop a simulation based K-steps look-ahead selection method which can result in nearly optimal schedules within reasonable computation times. Furthermore, we study the different distributed service times, e.g., Exponential, Weibull and lognormal distribution and the results show that the proposed algorithm can obtain better results than the lag order approximation method proposed by Vink et al. (2015) [Vink, W., Kuiper, A., Kemper, B., & Bhulai, S. (2015). Optimal appointment scheduling in continuous time: The lag order approximation method. European Journal of Operational Research, 240(1), 213-219.]. Finally, a realistic appointment scheduling includes experiments to verify the good performance of the proposed method.

Current optimization strategies are based on the increase the productivity and the quality with lower cost in short time. Grey relational analysis “GRA” based on Taguchi design was proposed in this paper for simultaneous improvement of surface quality and productivity. The turning trials based on mixed Taguchi L18 factorial plan were conducted under dry cutting conditions for the machining couple: AISI D3 steel/mixed ceramic inserts (CC650). The machining parameters taken into account during this study are as follow: major cutting edge angle (χr), cutting insert nose radius (r), cutting speed (Vc), feed rate (f), and depth of cut (ap). Significant effects of machining parameters and their interactions were evaluated by the analysis of variance. Through this analysis, it have been found clearly that feed rate and cutting insert nose radius had a big significant effects on surface quality while depth of cut, feed rate followed by cutting speed had a major effect on productivity. The mathematical relationship between the machining parameters and the performance characteristics was formulated by using a linear regression model with interactions. Optimal levels of parametric combination for achieving the higher surface quality with maximum productivity were selected by grey relational analysis which is based on the high value of grey relational grade. Confirmation experiments were carried out to prove the powerful improvement of experimental results and to validate the effectiveness of the multi-optimization technique applied in this paper.

This article discusses the ecological vehicle routing problem with a stop at a refueling station titled Green-Vehicle Routing Problem. In this problem, the refueling stations and the limit of fuel tank capacity are considered for the construction of a tour. We propose a variable neighborhood search to solve the problem. We tested and compared the performance of our algorithm intensively on datasets existing in the literature.

Decision making in supply chains is influenced by demand variations, and hence sales, purchase orders and inventory levels are therefore concerned. This paper presents a non-linear optimization model for a two-echelon supply chain, for a unique product. In addition, the model includes the consumers’ maximum willingness to pay, taking socioeconomic differences into account. To do so, the constrained multinomial logit for discrete choices is used to estimate demand levels. Then, a metaheuristic approach based on particle swarm optimization is proposed to determine the optimal product sales price and inventory coordination variables. To validate the proposed model, a supply chain of a technological product was chosen and three scenarios are analyzed: discounts, demand segmentation and demand overestimation. Results are analyzed on the basis of profits, lotsizing and inventory turnover and market share. It can be concluded that the maximum willingness to pay must be taken into consideration, otherwise fictitious profits may mislead decision making, and although the market share would seem to improve, overall profits are not in fact necessarily better.

In the present work, a recently developed advanced optimization algorithm named as teaching–learning-based optimization (TLBO) is used for the parameters optimization of fabric finishing system of a textile industry. Fabric Finishing System has four main subsystems, arranged in hybrid configuration. For performance modeling and analysis of availability, a performance evaluating model of fabric finishing system has been developed with the help of mathematical formulation based on Markov-Birth-Death process using Probabilistic Approach. Then, the overall performance of the concerned system has first analyzed and then, optimized by using teaching–learning-based optimization (TLBO). The results of optimization using the proposed algorithm are validated by comparing with those obtained by using the genetic algorithm (GA) on the same system. Improvement in the results is obtained by the proposed algorithm. The results of effect of variation of the algorithm parameters on fitness values of the objective function are reported.

This study uses an alternative fabrication scheme to study the effect of rework of nonconforming items and delayed differentiation on a multiproduct supply-chain system. Traditional economic production quantity model focuses on a single-product inventory system where all products made are assumed to be perfect quality and finished products are issued continuously. To increase machine utilization, lower quality costs in production, and reflect the real-world vendor-buyer integrated systems Chiu et al. (2016a) [Chiu, Y-S.P., Kuo, J-S., Chiu, S. W., Hsieh, Y-T. (2016a). Effect of delayed differentiation on a multiproduct vendor–buyer integrated inventory system with rework. Advances in Production Engineering & Management, 11(4), 333-344.] employed a single-machine two-stage production scheme to study the effects of rework and delayed differentiation on a multi-product supply-chain system. With the intention of further reducing fabrication cycle time, this study considers an alternative two-machine two-stage fabrication scheme to re-explore the problem in Chiu et al. (2016a). Machine one solely produces all common parts for multiple end products. Then, machine two fabricates the customized multiproduct using a common cycle time strategy. Through the use of mathematical modeling and analyses, the optimal production cycle length and distribution policy are derived. Numerical examples are provided to demonstrate practical usage of the research results, and show its significant benefit in reducing fabrication cycle time compared to that obtained from prior studies that used different schemes.

Capacitated maximal covering location problems (MCLP) have considered capacity constraint of facilities but these models have been studied in only one direction. In this paper, capacitated MCLP and dynamic MCLP are integrated with each other and dynamic capacity constraint is considered for facilities. Since MCLP is NP-hard and commercial software packages are unable to solve such problems in a rational time, Genetic algorithm (GA) and bee algorithm are proposed to solve this problem. In order to achieve better performance, these algorithms are tuned by Taguchi method. Sample problems are generated randomly. Results show that GA provides better solutions than bee algorithm in a shorter amount of time.