An iterative algorithm for scheduling UET tasks with due dates and release times

Zinder, Y

An iterative algorithm for scheduling UET tasks with due dates and release times

Zinder, Y

Permalink

Publication Type:: Journal Article
Citation:: European Journal of Operational Research, 2003, 149 (2), pp. 404 - 416
Issue Date:: 2003-09-01

Closed Access

	Filename	Description	Size
	2003000297.pdf		819.16 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	Zinder, Y https://orcid.org/0000-0003-2024-8129	en_US
dc.date.issued	2003-09-01	en_US
dc.identifier.citation	European Journal of Operational Research, 2003, 149 (2), pp. 404 - 416	en_US
dc.identifier.issn	0377-2217	en_US
dc.identifier.uri	http://hdl.handle.net/10453/3388
dc.description.abstract	A new polynomial-time iterative algorithm was studied for the scheduling problem with due dates, parallel identical processors, and release times. Each processor can process only one task at a time, and each task can be processes by nay processor. For the maximum lateness and makespan problems the algorithm allows to achieve the performance guarantees; earlier known only for the problems without release times.	en_US
dc.relation.ispartof	European Journal of Operational Research	en_US
dc.relation.isbasedon	10.1016/S0377-2217(02)00770-1	en_US
dc.subject.classification	Operations Research	en_US
dc.title	An iterative algorithm for scheduling UET tasks with due dates and release times	en_US
dc.type	Journal Article
utslib.citation.volume	2	en_US
utslib.citation.volume	149	en_US
utslib.for	010206 Operations Research	en_US
dc.location.activity	UNIV OSNABRUCK, MATH INFORMAT DEPT, OSNABRUCK, GERMANY
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	2	en_US
pubs.publication-status	Published	en_US
pubs.volume	149	en_US

Abstract:

A new polynomial-time iterative algorithm was studied for the scheduling problem with due dates, parallel identical processors, and release times. Each processor can process only one task at a time, and each task can be processes by nay processor. For the maximum lateness and makespan problems the algorithm allows to achieve the performance guarantees; earlier known only for the problems without release times.

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

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