Solution approaches for the parallel machine order acceptance and scheduling problem with sequence-dependent setup times, release dates and deadlines
by Papatya S. Bıçakcı; Tusan Derya; İmdat Kara
European J. of Industrial Engineering (EJIE), Vol. 15, No. 3, 2021

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]

Online publication date: Fri, 21-May-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the European J. of Industrial Engineering (EJIE):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email