The job shop scheduling problem with convex costs
Bürgy, Reinhard and Bülbül, Kerem (2018) The job shop scheduling problem with convex costs. European Journal of Operational Research, 268 (1). pp. 82-100. ISSN 0377-2217 (Print) 1872-6860 (Online)
This is the latest version of this item.
Official URL: http://dx.doi.org/10.1016/j.ejor.2018.01.027
The job shop scheduling literature has been dominated by a focus on regular objective functions -- in particular the makespan -- in its half a century long history. The last twenty years have encountered a spike of interest in other objectives, such as the total weighted tardiness, but research on non-regular objective functions has always been isolated and scattered. Motivated by this observation, we present a tabu search heuristic for a large class of job shop scheduling problems, where the objective is non-regular in general and minimizes a sum of separable convex cost functions attached to the operation start times and the differences between the start times of arbitrary pairs of operations. This problem definition generalizes a number of problems considered earlier in the literature. A particular notion of "critical paths" derived from the so-called timing problem is at the core of the proposed neighborhood definition exploited successfully in a tabu search algorithm. The computational results attest to the promise of our work.
Available Versions of this Item
Repository Staff Only: item control page