e-approximations with minimum packing constraint violation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
An approximation algorithm for the generalized assignment problem
Mathematical Programming: Series A and B
Selecting jobs for a heavily loaded shop with lateness penalties
Computers and Operations Research
Job selection in a heavily loaded shop
Computers and Operations Research
Improved approximation schemes for scheduling unrelated parallel machines
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Algorithms for Scheduling Independent Tasks
Journal of the ACM (JACM)
Open Shop Scheduling to Minimize Finish Time
Journal of the ACM (JACM)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Multiprocessor Scheduling with Rejection
SIAM Journal on Discrete Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Minimizing the total weighted completion time of deteriorating jobs
Information Processing Letters
Random-Based Scheduling: New Approximations and LP Lower Bounds
RANDOM '97 Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science
Scheduling-LPs Bear Probabilities: Randomized Approximations for Min-Sum Criteria
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
A FPTAS for Approximating the Unrelated Parallel Machines Scheduling Problem with Costs
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
On the approximability of trade-offs and optimal access of Web sources
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Multicriteria Scheduling: Theory, Models and Algorithms
Multicriteria Scheduling: Theory, Models and Algorithms
Scheduling parallel CNC machines with time/cost trade-off considerations
Computers and Operations Research
Order acceptance with weighted tardiness
Computers and Operations Research
Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria
INFORMS Journal on Computing
A survey of scheduling with controllable processing times
Discrete Applied Mathematics
Computers and Industrial Engineering
Theoretical Computer Science
An Optimal Incremental Algorithm for Minimizing Lateness with Rejection
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Order acceptance using genetic algorithms
Computers and Operations Research
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Bounded single-machine parallel-batch scheduling with release dates and rejection
Computers and Operations Research
A PTAS for parallel batch scheduling with rejection and dynamic job arrivals
Theoretical Computer Science
Scheduling with Rejection to Minimize the Makespan
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Single-machine scheduling under the job rejection constraint
Theoretical Computer Science
Parallel-machine scheduling with deteriorating jobs and rejection
Theoretical Computer Science
Computers and Operations Research
Bounded parallel-batch scheduling on unrelated parallel machines
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
ICIE '10 Proceedings of the 2010 WASE International Conference on Information Engineering - Volume 02
Two-machine flow-shop scheduling with rejection
Computers and Operations Research
A tabu search algorithm for order acceptance and scheduling
Computers and Operations Research
Revised Delivery-Time Quotation in Scheduling with Tardiness Penalties
Operations Research
On several scheduling problems with rejection or discretely compressible processing times
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
A bicriteria approach to scheduling a single machine with job rejection and positional penalties
Journal of Combinatorial Optimization
A faster algorithm for a due date assignment problem with tardy jobs
Operations Research Letters
Two due date assignment problems in scheduling a single machine
Operations Research Letters
Scheduling shops to minimize the weighted number of late jobs
Operations Research Letters
Hi-index | 0.00 |
In classical deterministic scheduling problems, it is assumed that all jobs have to be processed. However, in many practical cases, mostly in highly loaded make-to-order production systems, accepting all jobs may cause a delay in the completion of orders which in turn may lead to high inventory and tardiness costs. Thus, in such systems, the firm may wish to reject the processing of some jobs by either outsourcing them or rejecting them altogether. The field of scheduling with rejection provides schemes for coordinated sales and production decisions by grouping them into a single model. Since scheduling problems with rejection are very interesting both from a practical and a theoretical point of view, they have received a great deal of attention from researchers over the last decade. The purpose of this survey is to offer a unified framework for offline scheduling with rejection by presenting an up-to-date survey of the results in this field. Moreover, we highlight the close connection between scheduling with rejection and other fields of research such as scheduling with controllable processing times and scheduling with due date assignment, and include some new results which we obtained for open problems.