Common due window size and location determination in a single machine scheduling problem

Common due window size and location determination in a single machine scheduling problem

0.00 Avg rating0 Votes
Article ID: iaor19992342
Country: United Kingdom
Volume: 49
Issue: 9
Start Page Number: 1007
End Page Number: 1010
Publication Date: Sep 1998
Journal: Journal of the Operational Research Society
Authors: , ,
Keywords: production: JIT
Abstract:

We consider a single machine static and deterministic scheduling problem in which jobs have a common due window. Jobs completed within the window incur no penalties, other jobs incur either earliness or tardiness penalties. The objective is to find the optimal size and location of the window as well as an optimal sequence to minimise a cost function based on earliness, tardiness, window size, and window location. We propose an O(n log n) algorithm to solve the problem.

Reviews

Required fields are marked *. Your email address will not be published.