Search

This paper investigates coordinated scheduling on uniform parallel batch machines with batch transportation. Jobs are characterized by different processing time and sizes, and they are first delivered to manufacturers in batches and then processed on the uniform parallel batch machines. The manufacturers are distributed in different geographic zones and there exists one parallel batch machine in each manufacturer. A mixed integer programming model is developed for the studied problem, and its objective is to minimize the makespan. In addition, the structural properties of the problem are analyzed. A hybrid algorithm combining the merits of discrete particle swarm optimization (DPSO) and genetic algorithm (GA) is proposed to solve this problem. In the hybrid algorithm, a heuristic and a local search strategy are introduced. Finally, computational experiments are conducted and the results show that the proposed hybrid algorithm can effectively and efficiently solve the problem within a reasonable time, particularly in large-scale instances. [ABSTRACT FROM AUTHOR]

Many dynamic events exist in real manufacturing systems, such as arbitrary machine breakdowns and dynamic job arrivals, which makes the scheduling problem even more complicated. In this paper, we address a serial-batching scheduling problem with the above dynamic events. Jobs need to be processed on the serial-batching machines of two manufacturers and then transported by vehicles to a customer for further processing. The objective of the scheduling problem is to minimize the makespan, and the problem is proved to be strongly NP-hard. Some structural properties and a lower bound of the problem are also proved or derived. On the basis of job arrival times, we divide the problem into two phases and propose different rules regarding these two phases. Based on these properties and rules, a heuristic algorithm is developed to solve the problem and its worst case performance is analyzed. The heuristic algorithm is tested on a large set of randomly generated problem instances, and the relative gaps between the found lower bound and the solutions of the proposed heuristic algorithm are reported. The experimental results illustrate the high efficiency and effectiveness of the proposed heuristic algorithm compared with other four classic approaches. [ABSTRACT FROM AUTHOR]

Recovery of the end-of-use products has become a topic of considerable interest in the advanced manufacturing industry due in part to uncertainties in the quality and volume of product returns. The Internet of Things (IoT) that enables the tracing, detecting, storing, and analyzing the product life cycle data for each individual item can mitigate or eliminate these uncertainties. In this paper, an integrated three-stage model is presented based on IoT technology for the optimization of procurement, production and product recovery, pricing and strategy of return acquisition. The remaining value is used to measure the return condition. The model considers three recovery options related to refurbishing, component reuse and disposal, and the value deterioration for satisfying the product demand in each stage of product life cycle (PLC). A novel particle swarm optimization (PSO) algorithm based on two heuristic methods is proposed to solve the problem. A numerical example and sensitivity analysis are used to illustrate the performance of both algorithm and applicability of the model. [ABSTRACT FROM AUTHOR]