Order acceptance and scheduling with earliness and tardiness penalties

详细信息    查看全文

• 作者：Simon Thevenin ; Nicolas Zufferey ; Marino Widmer
• 关键词：Scheduling ; Earliness ; Tardiness ; Order acceptance ; Metaheuristics
• 刊名：Journal of Heuristics
• 出版年：2016
• 出版时间：December 2016
• 年：2016
• 卷：22
• 期：6
• 页码：849-890
• 全文大小：745 KB
• 刊物类别：Mathematics and Statistics
• 刊物主题：Mathematics
  Operations Research and Mathematical Programming
  Operation Research and Decision Theory
  Artificial Intelligence and Robotics
  Calculus of Variations and Optimal Control
  
• 出版者：Springer Netherlands
• ISSN：1572-9397
• 卷排序：22

文摘

This paper addresses a production scheduling problem in a single-machine environment, where a job can be either early, on time, late, or rejected. In order acceptance and scheduling contexts, it is assumed that the production capacity of a company is overloaded. The problem is therefore to decide which orders to accept and how to sequence their production. In contrast with the existing literature, the considered problem jointly takes into account the following features: earliness and tardiness penalties (which can be linear or quadratic), sequence-dependent setup times and costs, rejection penalties, and the possibility of having idle times. The practical relevance of this new NP-hard problem is discussed and various solution methods are proposed, ranging from a basic greedy algorithm to refined metaheuristics (e.g., tabu search, the adaptive memory algorithm, population-based approaches loosely inspired on ant algorithms). The methods are compared for instances with various structures containing up to 200 jobs. For small linear instances, the metaheuristics are favorably compared with an exact formulation using CPLEX 12.2. Managerial insights and recommendations are finally given.