Literature Review of Open Shop Scheduling Problems

• 作者: Ellur Anand Ramasamy Panneerselvam
• 来源期刊: 智能信息管理(英文)
• 学科: 数学
• 关键词: OPEN SHOP SCHEDULING Measures of Performance META-HEURISTICS HEURISTICS
• 年，卷（期）: znxxglyw_2015,（1）
• 页码范围: 33-52
• 页数: 20页
• 分类号: O1

摘要

This paper discusses review of literature of open shop scheduling problems. First, the problem is classified as per different measures of performance, viz., minimization of makespan, minimization of sum of completion times of jobs, minimization of sum of weighted completion times of all jobs, minimization of total tardiness of all jobs, minimization of sum of weighted tardiness of all jobs, minimization of weighted sum of tardy jobs, and miscellaneous measures of the open shop scheduling problem. In each category, the literature is further classified based on approaches used and then the contributions of researchers in the respective categories are presented. Directions for future research are discussed in the end.