Single Machine Scheduling with Rejection: Minimizing Total Weighted Completion Time and Rejection Cost

Authors:
Farouk Yalaoui;Atefeh Moghaddam;Lionel Amodeo;Behrooz Karimi
Affiliations:
University of Technology of Troyes, France;University of Technology of Troyes, France;University of Technology of Troyes, France;Amirkabir University of Technology, Iran
Venue:
International Journal of Applied Evolutionary Computation
Year:
2012

Citing 16
Cited 0

Multiprocessor Scheduling with Rejection

SIAM Journal on Discrete Mathematics
On-line uniform machine scheduling with rejection

Computing
Preemptive multiprocessor scheduling with rejection

Theoretical Computer Science
A Simulated Annealing Approach to Bicriteria Scheduling Problems on a Single Machine

Journal of Heuristics
Preemptive and Non-preemptive On-line Algorithms for Scheduling with Rejection on Two Uniform Machines

Computing
Online scheduling with machine cost and rejection

Discrete Applied Mathematics
Note: The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan

Theoretical Computer Science
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
A simulated annealing approach to a bi-criteria sequencing problem in a two-stage supply chain

Computers and Industrial Engineering
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
Performance assessment of multiobjective optimizers: an analysis and review

IEEE Transactions on Evolutionary Computation
A Simulated Annealing-Based Multiobjective Optimization Algorithm: AMOSA

IEEE Transactions on Evolutionary Computation
Dominance-Based Multiobjective Simulated Annealing

IEEE Transactions on Evolutionary Computation
A Simulated Annealing Algorithm for Prioritized Multiobjective Optimization—Implementation in an Adaptive Model Predictive Control Configuration

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
On-line scheduling of unit time jobs with rejection: minimizing the total completion time

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, the authors consider a single machine scheduling problem with rejection. In traditional research, it is assumed all jobs must be processed. However, in the real-world situation, certain jobs can be rejected. In this study, the jobs can be either accepted and scheduled or be rejected at the cost of a penalty. Two objective functions are considered simultaneously: (1) minimization of the sum of weighted completion times for the accepted jobs, and (2) minimization of the sum of penalties for the rejected jobs. The authors apply two-phase method (TPM), which is a general technique to solve bi-objective combinatorial optimization problems, to find all supported and non-supported solutions for small-sized problems. The authors present a mathematical model for implementing both phases. On the other hand, three different bi-objective simulated annealing algorithms have also been developed to find a good estimation of Pareto-optimal solutions for large-sized problems. Finally the authors discuss the results obtained from each of these algorithms.