Solution approaches for the parallel machine order acceptance and scheduling problem with sequence-dependent setup times, release dates and deadlines

Abstract

Order acceptance and scheduling problem arises when there is limited capacity to process all orders in a make-to-order environment. The paper examines the identical parallel machines order acceptance and scheduling problem with sequence-dependent setup times, release dates and deadlines. The extant literature is deeply researched, and it is concluded that well-designed mathematical formulations are still necessitated in this area. Therefore, a new formulation is proposed for this problem and a recent formulation is chosen from the literature in order to make the comparison. An extensive computational analysis is conducted to test the performance of the formulations. The proposed formulation outperformed the existing one in terms of run times and the number of optimal values. Besides, a variable neighbourhood search-based simulated annealing algorithm is propounded to solve large-sized instances. As a result, it is observed that the heuristic algorithm can solve large-sized instances effectively in a very short span of time. [Received: 18 December 2019; Accepted: 25 April 2020]