Optimal single machine scheduling about a common due window with earliness/tardiness and additional penalties
Optimal single machine scheduling about a common due window with earliness/tardiness and additional penalties
This paper is concerned with the optimal due dates and the optimal sequence to a set of jobs on a single-machine. The common due date assignment method is used, in which all jobs are assigned a common flow allowance. The objective is to find the optimal common due date and the optimal sequence to minimize an objective function of the sum of the Earliness/Tardiness (E/T) penalties and the additional penalties (including two dimensions, namely due date penalties and completion times penalties). It is assumed that E/T penalties will not occur if a job is completed within the due window. However, E/T penalties will occur if a job is completed outside the due window. Five lemmas and a polynomial-time algorithm are presented to determine the optimal common due date and the optimal sequence, a numerical example is provided to illustrate our algorithm.
1279-1284
Wu, Y.
e279101b-b392-45c4-b894-187e2ded6a5c
Wang, D.
8c543acd-825f-4f34-948a-dcd2e289f0aa
1999
Wu, Y.
e279101b-b392-45c4-b894-187e2ded6a5c
Wang, D.
8c543acd-825f-4f34-948a-dcd2e289f0aa
Wu, Y. and Wang, D.
(1999)
Optimal single machine scheduling about a common due window with earliness/tardiness and additional penalties.
International Journal of Systems Science, 30 (12), .
(doi:10.1080/002077299291570).
Abstract
This paper is concerned with the optimal due dates and the optimal sequence to a set of jobs on a single-machine. The common due date assignment method is used, in which all jobs are assigned a common flow allowance. The objective is to find the optimal common due date and the optimal sequence to minimize an objective function of the sum of the Earliness/Tardiness (E/T) penalties and the additional penalties (including two dimensions, namely due date penalties and completion times penalties). It is assumed that E/T penalties will not occur if a job is completed within the due window. However, E/T penalties will occur if a job is completed outside the due window. Five lemmas and a polynomial-time algorithm are presented to determine the optimal common due date and the optimal sequence, a numerical example is provided to illustrate our algorithm.
This record has no associated files available for download.
More information
Published date: 1999
Identifiers
Local EPrints ID: 36305
URI: http://eprints.soton.ac.uk/id/eprint/36305
ISSN: 0020-7721
PURE UUID: ea75071b-1f3a-4bce-b69d-92d5fc319136
Catalogue record
Date deposited: 01 Aug 2006
Last modified: 16 Mar 2024 03:39
Export record
Altmetrics
Contributors
Author:
D. Wang
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics