Lorenz versus Pareto Dominance in a Single Machine Scheduling Problem with Rejection
Scheduling problems have been studied from many years ago. Most of the papers which were published in this domain are different in one or many of issues as following: objective functions, machine environment, constraints and methodology for solving the problems. In this paper we address the problem of single machine scheduling in which due to some constraints like capacity, rejection of a set of jobs is accepted. The problem is considered as bi-objective one: minimization of the sum of weighted completion times for the accepted jobs and minimization of the sum of penalties for the rejected jobs. We find that in this problem, the solutions are not handled in a satisfactory way by general Pareto-dominance rule, so we suggest the application of Lorenz-dominance to an adapted bi-objective simulated annealing algorithm. Finally we justify the use of Lorenz-dominance as a useful refinement of Pareto-dominance by comparing the results.
KeywordsScheduling rejection Pareto-dominance Lorenz-dominance bi-objective simulated annealing
Unable to display preview. Download preview PDF.
- 13.Moghaddam, A., Yalaoui, F., Amodeo, L., Karimi, B., Jolai, F.: Developing a Technique for a Bi-objective Scheduling Model with Rejection by Simulated Annealing. In: MOSIM 2010, Hammamet, Tunisia (2010)Google Scholar
- 14.Jolai, F., Sangari, M.S., Babaie, M.: Pareto simulated annealing and colonial competitive algorithm to solve an offline scheduling problem with rejection. In: Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, doi: 10.1243/09544054JEM1746Google Scholar
- 15.Moghaddam, A., Yalaoui, F., Amodeo, L.: Single Machine Scheduling with Rejection: Minimizing total Weighted Completion Time and Rejection Cost. In: EURO XXIV, Lisbon, Portugal (2010)Google Scholar
- 17.Moghaddam, A., Amodeo, L., Yalaoui, F.: Simulated annealing for a bi-objective scheduling problem with rejection: comparative study. In: META 2010, Djerba, Tunisia (2010)Google Scholar
- 20.Golden, B., Perny, P.: Infinite order Lorenz dominance for fair multiagent optimization. In: van der Hoek, W., Kaminka, G.A., Lespérance, Y., Luck, M., Sen, S.: (eds.) Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2010), Toronto, Canada, May 10-14, pp. 383–390 (2010)Google Scholar
- 22.Moghaddam, A., Amodeo, L., Yalaoui, F.: Single Machine Scheduling with Rejection: Minimizing total Weighted Completion Time and Rejection Cost. Journal of Mathematical Modelling and Algorithms (to be submitted)Google Scholar
- 25.Mansouri, S.A.: A simulated annealing approach to a bi-criteria sequencing problem in a two-stage supply chain. Computers and Industrial Engineering, 1–15 (2006)Google Scholar
- 29.Riise, A.: Comparing genetic algorithms and tabu search for multi-objective optimization. In: IFORS, Proceedings of Abstract Conference, p. 29 (2002)Google Scholar