title   
  

The job shop scheduling problem with convex costs

Warning The system is temporarily closed to updates for reporting purpose.

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.

[img]
Preview
PDF (This is a RoMEO green journal -- author can archive pre-print (ie pre-refereeing)) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
555Kb

Official URL: http://dx.doi.org/10.1016/j.ejor.2018.01.027

Abstract

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.

Item Type:Article
Uncontrolled Keywords:scheduling; job shop; non-regular objective; convex costs; tabu search
Subjects:T Technology > T Technology (General) > T055.4-60.8 Industrial engineering. Management engineering
T Technology > T Technology (General) > T055.4-60.8 Industrial engineering. Management engineering > T57.6-57.97 Operations research. Systems analysis
ID Code:34933
Deposited By:Kerem Bülbül
Deposited On:16 Aug 2018 11:49
Last Modified:16 Aug 2018 11:49

Available Versions of this Item

Repository Staff Only: item control page