Scheduling the production of two-component jobs on a single machine
Scheduling the production of two-component jobs on a single machine
In this paper, we examine the scheduling of jobs, each of which comprises a standard and a specific component, on a single machine. A set-up time is required before each batch of standard components is processed. A job is completed when both its standard and specific components have been processed and are available. Standard components only become available when the batch to which they belong is completed, whereas specific components are available on completion of their processing. We present results for two well-known due-date related criteria. In particular, an O(n2) dynamic programming algorithm is derived for the problem of minimising the maximum lateness. For minimising the number of late jobs, we show that the problem is NP-hard and give a dynamic programming algorithm that requires pseudo-polynomial time. Finally, we show that a variant of the number of late jobs problem, in which there is a common processing time for the standard components, is solvable in O(n4 log n) time.
component scheduling, single machine, dynamic programming, NP-hard
250-259
Gerodimos, Alex E.
e07c9259-2c2b-4edd-9153-2ed16a5008b3
Glass, Celia A.
4ae457e5-b653-49d7-8adb-1766901371cb
Potts, Chris N.
58c36fe5-3bcb-4320-a018-509844d4ccff
2000
Gerodimos, Alex E.
e07c9259-2c2b-4edd-9153-2ed16a5008b3
Glass, Celia A.
4ae457e5-b653-49d7-8adb-1766901371cb
Potts, Chris N.
58c36fe5-3bcb-4320-a018-509844d4ccff
Gerodimos, Alex E., Glass, Celia A. and Potts, Chris N.
(2000)
Scheduling the production of two-component jobs on a single machine.
European Journal of Operational Research, 120 (2), .
(doi:10.1016/S0377-2217(99)00154-X).
Abstract
In this paper, we examine the scheduling of jobs, each of which comprises a standard and a specific component, on a single machine. A set-up time is required before each batch of standard components is processed. A job is completed when both its standard and specific components have been processed and are available. Standard components only become available when the batch to which they belong is completed, whereas specific components are available on completion of their processing. We present results for two well-known due-date related criteria. In particular, an O(n2) dynamic programming algorithm is derived for the problem of minimising the maximum lateness. For minimising the number of late jobs, we show that the problem is NP-hard and give a dynamic programming algorithm that requires pseudo-polynomial time. Finally, we show that a variant of the number of late jobs problem, in which there is a common processing time for the standard components, is solvable in O(n4 log n) time.
This record has no associated files available for download.
More information
Published date: 2000
Keywords:
component scheduling, single machine, dynamic programming, NP-hard
Organisations:
Operational Research
Identifiers
Local EPrints ID: 29611
URI: http://eprints.soton.ac.uk/id/eprint/29611
ISSN: 0377-2217
PURE UUID: 7f940f5b-2118-431f-a32b-b30418184420
Catalogue record
Date deposited: 19 Jul 2006
Last modified: 15 Mar 2024 07:33
Export record
Altmetrics
Contributors
Author:
Alex E. Gerodimos
Author:
Celia A. Glass
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