Multiprocessor Scheduling with Rejection

Abstract

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:

Single Machine Schedule Problem with a Fixed Unavailability Interval and Rejection

“…The machine scheduling problem with rejection was first introduced by Bartal et al [1] and the objective is minimizing the sum of the makespan for the accepted jobs plus the total rejection penalties of the rejected jobs. Considered the situations of on-line and off-line, respectively proposed on-line algorithm and a full polynomial time approximation scheme(FPTAS).…”

Inventory and Facility Location Models with Market Selection

“…There are several other models, such as the prize-collecting travelling salesman problem [2,6], prize-collecting Steiner tree [10,9] and multi-processor scheduling with rejection [4], where classical combinatorial optimization problems were extended to consider rejection/selection decisions. However, in all of these models the rejection /selection decisions are made independently for each element (node or a job).…”

On-line scheduling of unit time jobs with rejection: minimizing the total completion time

“…Scheduling with rejection was ÿrst considered by Bartal et al [1] who concentrated on o -line and on-line results for non-preemptive makespan on parallel machines. For preemptive makespan on parallel machines with rejection, Seiden [5] considered the on-line variant, whereas Hoogeveen et al [3] considered the o -line variant.…”