Single-machine batch delivery scheduling with job release dates,due windows and earliness,tardiness, holding and delivery costs |
| |
| Affiliation: | 1. Business School, Sichuan University, Chengdu 610065, PR China;2. Institute of Textiles and Clothing, The Hong Kong Polytechnic University, Hong Kong, PR China;3. Department of Industrial and System Engineering, University of Wisconsin–Madison, Madison, WI 53706, USA;1. Department of Industrial Engineering, University College of Engineering, University of Tehran, Iran;2. Faculty of Information Technology, Monash University, Caulfield East, VIC 3145, Australia;1. Department of Mathematics and Computer Science, University of Hagen, D-58097 Hagen, Germany;2. Chair of Operations Management, WHU - Otto Beisheim School of Management, D-56179 Vallendar, Germany;1. School of Information Technology, Jiangxi University of Finance and Economics, PR China;2. Institute of Operational Research and Cybernetics, Hangzhou Dianzi University, Hangzhou 310018, PR China |
| |
| Abstract: | This paper deals with a single-machine scheduling problem in which jobs are released in different points in time but delivered to customers in batches. A due window is associated with each job. The objective is to schedule the jobs, to form them into batches and to decide the delivery date of each batch so as to minimize the sum of earliness, tardiness, holding, and delivery costs. A mathematical model of the problem is presented, and a set of dominance properties is established. To solve this NP-hard problem efficiently, a solution method is then proposed by incorporating the dominance properties with an imperialist competitive algorithm. Unforced idleness and forming discontinuous batches are allowed in the proposed algorithm. Moreover, the delivery date of a batch may be decided to be later than the completion time of the last job in the batch. Finally, computational experiments are conducted to evaluate the proposed model and solution procedure, and results are discussed. |
| |
| Keywords: | Scheduling Single-machine Batch delivery Release dates Due windows Dominance properties Imperialist competitive algorithm |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
