Abstract: This study considers a sequential batching problem with a minimum quantity commitment (MQC) constraint in N-level non-exclusive agglomerative hierarchical clustering structures (AHCSs). In this problem, batches are created for item types included in clusters according to the sequence of the levels in a given AHCS such that the MQC constraint as well as the maximum and minimum batch size requirements are satisfied, simultaneously. The MQC constraint ensures that more items than a committed minimum quantity must be batched at a level before items not batched at the level are sent to the next level. We apply the MQC constraint to control effectively the degree of heterogeneity (DoH) in the batching results. We developed a sequential batching algorithm for minimizing the total processing cost of items using properties identified to find better solutions of large-sized practical problems. Results of computational experiments showed that the developed algorithm found very good solutions quickly and the heuristic algorithm could be used in various practical sequential batching problems with the MQC constraint such as input lot formations in semiconductor wafer fabrication facilities, determination of truckloads in delivery service industry, etc. Also, we found some meaningful insights that dense cluster, small batch size, and tight MQC constraint are effective in reducing the total processing cost. Additionally, small batch size with loose MQC constraint seem to be helpful to reduce the DoH in the batching results. Finally, we suggested that the density of cluster, batch size, and MQC tightness should be determined simultaneously because of interactions among these factors.

	© 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 in today’s highly competitive global markets, transnational enterprises always seek to optimize internal vendor-buyer coordinated systems to ensure timeliness and quality deliveries, given the reality of unreliable machines and limited capacity. To facilitate accurate decision making to help organizations gain competitive advantages in such situations, this study explores an intra-supply-chain problem featuring a partial outsourcing batch fabrication plan, random scrap, Poisson-distributed breakdown rate, and multiple shipments of end-product. First, we build a model to characterize the problem clearly. Then, we carry out formulations, analyses, and derivations of the model to attain the problem’s cost function. We then use differential calculus and propose a specific algorithm to confirm the convexity of the obtained cost function and derive the optimal runtime. Finally, we offer a numerical illustration to demonstrate the result’s applicability for other business circumstances. Additional elements of the problem are then discussed, including the individual and combined influence of variations in scrap, outsourcing, breakdown, and shipping frequency. The features of an optimal operating policy and cost relevant parameters are now revealed to assist management with strategic planning and decision making in real-world intra-supply-chain environments.

	© 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: Multi-Objective (MO) optimization is a well-known research field with respect to the complexity of production planning and scheduling. In recent years, many different Evolutionary Computation (EC) methods have been applied successfully to MO production planning and scheduling. This paper is focused on making a review of MO production scheduling methods, starting from production scheduling presentation, notation and classification. The research field of EC methods is presented, then EC algorithms` classification is introduced for the purpose of production scheduling optimization. As a main goal, MO optimization is focused on hybrid EC methods, and presenting their advantages and limitations. Finally, a survey of five scientific databases is presented, with the analysis of the scientific publications the terminology development of the scientific field is presented. Using the citation analysis of the scientific publications, the application for the MO optimization in manufacturing scheduling is discussed.

	© 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: In the world of digitization, e-commerce practices has become more popular and attracts manufacturers to combine their traditional retail channel with an e-channel. To add some salient features in the existing study, this study develops an optimal pricing and profit decision model for manufacturer-led dual-channel supply chain configurations; namely Vertically Integrated Dual-Supply Chain (VID-SC), Decentralized Dual-channel Supply Chain (DD-SC), Partially Integrate Dual-Supply Chain (PID-SC) and Horizontally Integrated Dual-Supply Chain (HID-SC). The aim of this study is to examine the effect of selected decision parameters namely cooperative advertisement, delivery lead time and free-riding on price and profit of manufacturer-led dual supply chain configurations. A linear programming for profit maximization is developed and backward induction method is used to find the optimum values of price and profit. A numerical analysis is performed to evaluate the effect of selected decision parameters on price and profit. To check the robustness of the outcomes an interaction plot is made to indicate the relationship between the selected decision parameters on optimum price. The best fit values of these decision parameters lead to the optimum price and the profit. The study helps to find the best fit value of the selected decision parameters for their specified dual-channel configuration. As a result, the model contributes as a guideline moreover it is proficient to guide manufacturers and channel members as a decision making practices without actual implementation of any strategy or policy.

	© 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 Additive Manufacturing (AM) scheduling problem is becoming a very felt issue not only by the scholars but also by the practitioners who are looking to this new technology as a new integrated part of their traditional production systems. They need new scheduling models to adapt the traditional scheduling rules to the changed ones of the additive manufacturing. This paper deals with the enhancement of a scheduling problem for additive manufacturing just present in literature and the presentation of a new meta-heursitic (adapted to the new requirements of the additive manufacturing technology) based on the tabu-search 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: Jaya algorithm has recently been proposed, which is simple and efficient meta-heuristic optimization technique and has received a great attention in the world of optimization. It has been successfully applied to some thermal, design and manufacturing associated optimization problems. This paper aims to analyze the performance of Jaya algorithm for permutation flow-shop scheduling problem which is a well-known NP-hard optimization problem. The objective is to minimize the makespan. First, to make Jaya algorithm adaptive to the problem, a random priority is allocated to each job in a permutation sequence. Second, a job priority vector is converted into job permutation vector by means of Largest Order Value (LOV) rule. An exhaustive comparative study along with statistical analysis is performed by comparing the results with public benchmarks and other competitive heuristics. The key feature of Jaya algorithm of simultaneous movement towards the best solution and going away from the worst solution enables it to avoid being trapped in the local optima. Furthermore, the uniqueness of Jaya algorithm compared with any other evolutionary based optimization technique is that it is totally independent of specific parameters. This substantially reduces the computation effort and numerical complexity. Computational results reveal that Jaya algorithm is efficient in most cases and has considerable potential for permutation flow-shop scheduling problems.

	© 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: Workload control theory seeks to align capacity and demand to improve delivery performance. However, workload control researchers mainly focused on input control, which regulates the input of work to the production system, thereby neglecting output control, which uses capacity adjustments to regulate the outflow of the work. Moreover, few existing studies on output control investigate a temporarily increase in capacity. This paper introduces a new search direction for output control which does not require an increase in capacity – labour flexibility. Idle operators can move from their workstation to another, thus temporarily increasing the output of that workstation without extra capacity. Using simulation of a five workstations flow shop line, we highlight the positive performance effect of labour flexibility. However, this comes at the cost of high labour movement. Introducing a load-based constraint on when workers are allowed to significantly reduces labour movement, while realizing most of the performance improvement observed for unconstrained labour movement. This has important implications for future research and practice.

	© 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 Medical System of Transportation deals with two online real-time decisions: ambulance dispatching and relocation. Dispatching consists of selecting which ambulance to send to an emergency call; relocation consists of determining how to modify the location of available ambulances in response to changes in the system’s state. Although the literature regarding this problem is extensive, only a limited number of online real-time approaches for ambulance management have been proposed, much less one taking into consideration different types of emergencies and vehicles. This paper proposes an online real-time matheuristic algorithm that combines: i) a new preparedness index defined as the availability probability of a multi-server queue model which is used as an optimization objective and as a control variable for relocation strategies, ii) two mathematical models to solve the relocation problem, one oriented to the maximization of coverage and other to the minimization of the maximum relocation time, and iii) two heuristic algorithms oriented to the maximization of the preparedness level, one to solve the dispatch problem and other to solve the location problem of one ambulance. The computational experiments, based on discrete event simulation and historical data of Bogotá, Colombia, have shown their capability to adequately respond to the necessities of real-time operation.

	© 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: In this paper, the flow shop with blocking and sequence and machine dependent setup time problem aiming to minimize the makespan is studied. Two mixed-integer programming models are proposed (TNZBS1 and TNZBS2) and two other mixed-integer programming models, originally proposed for the no setup problem, are adapted to the problem. Furthermore, an Iterated Greedy algorithm is proposed for the problem. The permutation flow shop with blocking and sequence and machine dependent setup time is an underexplored problem and the authors did not find the use of mixed-integer programming models for the problem in any other work. To compare the models, a database of 80 problems was generated, which vary in number of machines and jobs. For the small sized problems, the adapted MILP model obtained the best results. However, for bigger problems, both proposed MILP models obtained significantly better results compared to the adapted models, proving the efficiency of the new models. When comparing the Iterated Greedy algorithm with the MILP models, the former outperformed the latter.

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