Abstract: The competition manufacturing companies face has driven the development of novel and efficient methods that enhance the decision making process. In this work, a specific flow shop scheduling problem of practical interest in the industry is presented and formalized using a mathematical programming model. The problem considers a manufacturing system arranged as a work cell that takes into account the transport operations of raw material and final products between the manufacturing cell and warehouses. For solving this problem, we present a multiobjective metaheuristic strategy based on simulated annealing, the Pareto Archived Simulated Annealing (PASA). We tested this strategy on two kinds of benchmark problem sets proposed by the authors. The first group is composed by small-sized problems. On these tests, PASA was able to obtain optimal or near-optimal solutions in significantly short computing times. In order to complete the analysis, we compared these results to the exact Pareto front of the instances obtained with augmented ε-constraint method. Then, we also tested the algorithm in a set of larger problems to evaluate its performance in more extensive search spaces. We performed this assessment through an analysis of the hypervolume metric. Both sets of tests showed the competitiveness of the Pareto Archived Simulated Annealing to efficiently solve this problem and obtain good quality solutions while using reasonable computational resources.

	© 2018 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: Modelling is an effective way of designing, understanding, and analysing bio-refinery supply chain systems. The supply chain is a complex process consisting of many systems interacting with each other. It requires the modelling of the processes in the presence of multiple autonomous entities (i.e. biomass producers, bio-processors and transporters), multiple performance measures and multiple objectives, both local and global, which together constitute very complex interaction effects. In this paper, simulation models for recovering biomass from the field of the biorefinery are developed and validated using some industry data and the minimum biomass recovery cost is established based on different strategies employed for recovering biomass. Energy densification techniques are evaluated for their net present worth and the technologies that offer greater returns for the industry are recommended. In addition, a new scheduling algorithm is also developed to enhance the process flow of the management of resources and the flow of biomass. The primary objective is to investigate different strategies to reach the lowest cost delivery of sugarcane harvest residue to a sugar factory through optimally located bio-refineries. A simulation /optimisation solution approach is also developed to tackle the stochastic variables in the bioenergy production system based on different statistical distributions such as Weibull and Pearson distributions. In this approach, a genetic algorithm is integrated with simulation to improve the initial solution and search the near-optimal solution. A case study is conducted to illustrate the results and to validate the applicability for the real world implementation using ExtendSIM Simulation software using some real data from Australian Mills.

	© 2018 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: This paper addresses the minimization of makespan for the permutation flow shop scheduling problem with blocking and sequence and machine dependent setup times, a problem not yet studied in previous studies. The 14 best known heuristics for the permutation flow shop problem with blocking and no setup times are pre-sented and then adapted to the problem in two different ways; resulting in 28 different heuristics. The heuristics are then compared using the Taillard database. As there is no other work that addresses the problem with blocking and sequence and ma-chine dependent setup times, a database for the setup times was created. The setup time value was uniformly distributed between 1% and 10%, 50%, 100% and 125% of the processing time value. Computational tests are then presented for each of the 28 heuristics, comparing the mean relative deviation of the makespan, the computational time and the percentage of successes of each method. Results show that the heuristics were capable of providing interesting results.

	© 2018 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 implementation of just-in-time (JIT) principles has been shown to be worthy of analysis due to its potential economic benefits. Yet, while several empirical studies have reported the success of adopting JIT management concepts, little work has been accomplished in offering analytical tools for assisting managers for implementing JIT strategy. This paper proposes a new inventory model to better embrace JIT purchasing. In pursuing this goal, we develop a deterministic single-setup multiple-delivery model for deteriorating items by considering the effect of the time value of money (TVM). We propose a solution procedure to determine the optimal decisions that maximize the discounted profit function of this analytical model, and compare it with some other alternatives. Here, we show the derivation of the mathematical model, the algorithm of the proposed solutions, and the application of the new approach through two numerical experiments. The study reveals that modeling the TVM effect complicates the determination of an optimal JIT inventory policy; nevertheless, we find that accounting for TVM can be decisive in terms of promoting and implementing JIT purchasing agreements.

	© 2018 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 Flexible flow shop (FFS) is defined as a multi-stage flow shops with multiple parallel machines. FFS scheduling problem is a complex combinatorial problem which has been intensively studied in many real world industries. This review paper gives a comprehensive exploration review on the FFS scheduling problem and guides the reader by considering and understanding different environmental assumptions, system constraints and objective functions for future research works. The published papers are classified into two categories. First is the FFS system characteristics and constraints including the problem differences and limitation defined by different studies. Second, the scheduling performances evaluation are elaborated and categorized into time, job and multi related objectives. In addition, the resolution approaches that have been used to solve FFS scheduling problems are discussed. This paper gives a comprehensive guide for the reader with respect to future research work on the FFS scheduling problem.

	© 2018 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: Deteriorating inventory models are used as decision support tools for managers primarily, although not exclusively, in the retail trade. The mathematical modeling of deteriorating items allows managers to analyze their inventory management systems to identify areas that can be improved and to measure the corresponding potential benefits. This study develops an enhanced deteriorating inventory model for optimizing the inventory control strategy of companies operating in sectors with deteriorating products. In contrast with previous studies, our model holistically accounts for the overall financial effect of a company’s policies on product price discounting and on inventory shortages while considering the time value of money (TVM). We aim to find the optimal replenishment strategy and the optimal price reductions that maximize the discounted profit function of this analytical model over a fixed planning horizon. To this end, we use an economic order quantity model to study the effects of the TVM and inflation. The model accounts for pre- and post-deterioration discounts on the selling price for non-instantaneous deteriorating products with the demand rate being a function of time, price-discounts and stock-keeping units. Shortages are allowed and partially backordered, depending on the waiting time until the next replenishment. Additionally, we consider the effect of discounts on the selling price when items have either an instant deterioration or a fixed lifetime. We propose five implementable solutions for obtaining the optimal values, and examine their performance. We present some numerical examples to illustrate the applicability of the models, and carry out a sensitivity analysis. The study reveals that accounting for TVM and inventory shortages is complex and time-consuming; nevertheless, we find that accounting for TVM and shortages can be valuable in terms of increasing the yields of companies. Finally, we provide some important managerial implications to support decision-making processes.

	© 2018 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: This work is devoted to the study of the Uncertain Quay Crane Scheduling Problem (QCSP), where the loading /unloading times of containers and travel time of quay cranes are considered uncertain. The problem is solved with a Simulation Optimization approach which takes advantage of the great possibilities offered by the simulation to model the real details of the problem and the capacity of the optimization to find solutions with good quality. An Ant Colony Optimization (ACO) meta-heuristic hybridized with a Variable Neighborhood Descent (VND) local search is proposed to determine the assignments of tasks to quay cranes and the sequences of executions of tasks on each crane. Simulation is used inside the optimization algorithm to generate scenarios in agreement with the probabilities of the distributions of the uncertain parameters, thus, we carry out stochastic evaluations of the solutions found by each ant. The proposed optimization algorithm is tested first for the deterministic case on several well-known benchmark instances. Then, in the stochastic case, since no other work studied exactly the same problem with the same assumptions, the Simulation Optimization approach is compared with the deterministic version. The experimental results show that the optimization algorithm is competitive as compared to the existing methods and that the solutions found by the Simulation Optimization approach are more robust than those found by the optimization algorithm.

	© 2018 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: Designing a production process normally is involved with some important constraints such as uncertainty, trade-off between production costs and quality, customer’s expectations and production tolerances. In this paper, a novel multi-objective robust optimization model is introduced to investigate the best levels of design variables. The primary objective is to minimize the production cost while increasing robustness and performance. The response surface methodology is utilized as a common approximation model to fit the relationship between responses and design variables in the worst-case scenario of uncertainties. The target mean ratio α is applied to ensure the quality of the process by providing the robustness for all types of quality characteristics and with a trade-off between variability and deviance from the ideal point. The Lp metric method is used to integrate all objectives in one overall function. In order to estimate target value of the quality loss by considering production tolerances, the process capability ratio (C_pm) is applied. At the end, a numerical chemical mixture problem is served to show the applicability of the proposed method.

	© 2018 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)