Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs |
| |
| Institution: | 1. College of Administrative Sciences, University of Alabama in Huntsville, Huntsville, AL 35899, USA;2. Department of Industrial Engineering, Polytechnic University of Puerto Rico, San Juan, PR 00919-2017, USA;1. Centre de Mathématiques Appliquées, Ecole Polytechnique, CNRS, Université Paris-Saclay, 91128 Palaiseau, France;2. Laboratoire Jean Kuntzmann, CNRS, Université Grenoble-Alpes, BP 53, 38041 Grenoble Cedex 9, France;3. SIMaP, Université Grenoble-Alpes, BP 53, 38041 Grenoble Cedex 9, France;1. LIMOS, UMR CNRS 6158, SIGMA Clermont, Campus des Cézeaux-CS 20265, 63178 Aubière Cedex, France;2. LOGIQ Research Group, University of Sfax, Tunisia;3. Industrial Engineering Department, College of Engineering, K.S.U, Saudi Arabia;1. Ph.D.’s Degree Program in Industrial Engineering, Department of Industrial Engineering, Faculty of Engineering, Chiang Mai University, Chiang Mai, Thailand;2. Excellence Center in Logistics and Supply Chain Management (E-LSCM), Chiang Mai University, 239 Huay Kaew Rd., Chiang Mai 50200, Thailand;1. Key Laboratory of Road Construction Technology and Equipment of MOE, Chang’an University, Xi’an, Shaanxi 710064, China;2. Institute of Smart Manufacturing Systems Engineering, Chang’an University, Xi’an, Shaanxi 710064, China;3. State Key Laboratory of Precision Electronic Manufacturing Technology and Equipment, Guangdong University of Technology, Guangzhou 510006, China;4. Hubei University of Automotive Technology, Shiyan, Hubei 442002, China;5. Chengdu Research Institute, City University of Hong Kong, Chengdu 610200, China;6. Shenzhen Research Institute, City University of Hong Kong, Shenzhen 518057, China |
| |
| Abstract: | This paper considers the problem of generating a set of efficient (non-dominated) schedules on identical parallel machines involving total flow-time and total number of tardy jobs. In view of the NP-hard nature of this problem, heuristic algorithms are proposed for its solution. Two evaluation methods that provide a scheme by which multiple non-dominated sets can be compared are described and used to compare the performance of the proposed algorithms. Results of several experiments demonstrate the capability of the proposed algorithms and evaluation methodologies to address the problem at hand. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
