Scheduling identical jobs and due-window on uniform machines

We extend a classical common due-window assignment problem to a setting of parallel uniform machines. Jobs are assumed to have identical processing times. The objective is minimum earliness, tardiness, due-window starting time, and due-window size. We focus on the case of two machines. Despite the many (12) candidate schedules for optimality, an efficient constant time solution is introduced.

MoreLess

Year of publication:	2010
Authors:	Mosheiov, Gur ; Sarig, Assaf
Published in:	European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 201.2010, 3, p. 712-719
Publisher:	Elsevier
Keywords:	Scheduling Earliness Tardiness Uniform machines Due-window

Online Resource

Check full text access |

More access options

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10008483195