The Online Target Date Assignment Problem

Abstract

People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal. If the publication is distributed under the terms of Article 25fa of the Dutch Copyright Act, indicated by the "Taverne" license above, please follow below link for the End User Agreement:

clever or smart: Strategies for the online target date assignment problem

“…. , r m ) where m is even which leads to the ratio given on the right hand side of equation (7). Using ε → 0…”

“…A general framework for online problems with a two stage decision process structure is the Online Target Date Assignment Problem. It was introduced by Heinz et al [7]. Requests are released at certain dates.…”

“…In a feasible solution with respect to a downstream problem Π each request is allocated a feasible target date and for each target date, the instance of the corresponding offline problem Π is feasible as well. For a detailed description of the Online Target Date Assignment Problem and competitive online algorithms we refer the reader to [7].…”