The worst-case analysis of the Garey-Johnson algorithm

Hanen, C; Zinder, Y

The worst-case analysis of the Garey-Johnson algorithm

Hanen, C Zinder, Y

Permalink

Publication Type:: Journal Article
Citation:: Journal of Scheduling, 2009, 12 (4), pp. 389 - 400
Issue Date:: 2009-08-01

Closed Access

	Filename	Description	Size
	2008007805OK.pdf		556.82 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Hanen, C	en_US
dc.contributor.author	Zinder, Y https://orcid.org/0000-0003-2024-8129	en_US
dc.date.issued	2009-08-01	en_US
dc.identifier.citation	Journal of Scheduling, 2009, 12 (4), pp. 389 - 400	en_US
dc.identifier.issn	1094-6136	en_US
dc.identifier.uri	http://hdl.handle.net/10453/8924
dc.description.abstract	The Garey-Johnson algorithm is a well known polynomial-time algorithm constructing an optimal schedule for the maximum lateness problem with unit execution time tasks, two parallel identical processors, precedence constraints and release times. The paper is concerned with the worst-case analysis of a generalization of the Garey-Johnson algorithm to the case of arbitrary number of processors. In contrast to other algorithms for the maximum lateness problem, the tight performance guarantee for the even number of processors differs from the tight performance guarantee for the odd number of processors. © 2009 Springer Science+Business Media, LLC.	en_US
dc.relation.ispartof	Journal of Scheduling	en_US
dc.relation.isbasedon	10.1007/s10951-009-0101-4	en_US
dc.subject.classification	Operations Research	en_US
dc.title	The worst-case analysis of the Garey-Johnson algorithm	en_US
dc.type	Journal Article
utslib.citation.volume	4	en_US
utslib.citation.volume	12	en_US
utslib.for	0103 Numerical and Computational Mathematics	en_US
utslib.for	0102 Applied Mathematics	en_US
utslib.for	1503 Business and Management	en_US
dc.location.activity	ISI:000267592300004	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Science
pubs.organisational-group	/University of Technology Sydney/Faculty of Science/School of Mathematical and Physical Sciences
utslib.copyright.status	closed_access
pubs.issue	4	en_US
pubs.publication-status	Published	en_US
pubs.volume	12	en_US

Abstract:

The Garey-Johnson algorithm is a well known polynomial-time algorithm constructing an optimal schedule for the maximum lateness problem with unit execution time tasks, two parallel identical processors, precedence constraints and release times. The paper is concerned with the worst-case analysis of a generalization of the Garey-Johnson algorithm to the case of arbitrary number of processors. In contrast to other algorithms for the maximum lateness problem, the tight performance guarantee for the even number of processors differs from the tight performance guarantee for the odd number of processors. © 2009 Springer Science+Business Media, LLC.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/8924