Earliness–tardiness minimization on scheduling a batch processing machine with non-identical job sizes |
| |
| Affiliation: | 1. School of Management, University of Science and Technology of China, Hefei 230026, PR China;2. School of Business, Hohai University, Nanjing 211100, PR China;3. Department of Industrial and Systems Engineering, University of Tennessee, Knoxville, TN 37996-0700, USA;1. Centro de Investigaciones Energéticas Medioambientales y Tecnológicas (CIEMAT), 28040 Madrid, Spain;2. Departamento de Arquitectura Computadores y Automática, Facultad de Informática, Universidad Complutense de Madrid, 28040 Madrid, Spain;3. Laboratorio Nacional de Fusión, Asociación EURATOM-CIEMAT, 28040 Madrid, Spain;1. School of Business, Shanghai Dian Ji University, Shanghai 201306, PR China;2. School of Mechanical Engineering, Shanghai Jiao Tong University, Shanghai 200240, PR China;3. Industrial and Systems Engineering, The University of Tennessee at Knoxville, 525D John D. Tickle Engineering Building, Knoxville, TN 37996, USA;1. Department of Information Technology, Zhejiang Institute of Economics and Trade, Hangzhou 310018, PR China;2. School of Management and E-Business, Contemporary Business and Trade Research Center, Zhejiang Gongshang University, Hangzhou 310018, PR China;3. Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Kowloon, Hong Kong;4. School of Information Science and Engineering, Shenyang University of Technology, Shenyang 110023, PR China |
| |
| Abstract: | This paper considers the scheduling problem of minimizing earliness–tardiness (E/T) on a single batch processing machine with a common due date. The problem is extended to the environment of non-identical job sizes. First, a mathematical model is formulated, which is tested effectively under IBM ILOG CPLEX using the constraint programming solver. Then several optimal properties are given to schedule batches effectively, and by introducing the concept of ARB (Attribute Ratio of Batch), it is proven that the ARB of each batch should be made as small as possible in order to minimize the objective, designed as the heuristic information for assigning jobs into batches. Based on these properties, a heuristic algorithm MARB (Minimum Attribute Ratio of Batch) for batch forming is proposed, and a hybrid genetic algorithm is developed for the problem under study by combining GA (genetic algorithm) with MARB. Experimental results demonstrate that the proposed algorithm outperforms other algorithms in the literature, both for small and large problem instances. |
| |
| Keywords: | Scheduling Batch processing machine Earliness–tardiness minimization Genetic algorithm |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
