Citation
Enumeration Of Pareto Optima For Uniform Parallel Machine Scheduling With Two Criteria. In proceedings of the 2nd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2005), 18 -21 July 2005, New York, USA, pages 123-131, 2005.
Paper
Abstract
In this paper we consider the solution of an uniform parallel machine scheduling problem with two criteria. The aim is to minimise the makespan as well as the maximum lateness of jobs. We first propose a heuristic by progressive construction which tries to solve the problem without studing all possible solutions. An efficient branch-and-bound algorithm to compute a strict Pareto optimum is presented. In this method we introduce the preemptive feasibility test and energetic test which are used to prune nodes in the search tree. We have also integrated other methods in this branch-and-bound algorithm to reduce the search space.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2005-123-131-P, author = {K. Bouibede-Hocine and V. T’kindt},
title = {Enumeration Of Pareto Optima For Uniform Parallel Machine Scheduling With Two Criteria},
booktitle = {In proceedings of the 2nd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2005), 18 -21 July 2005, New York, USA},
year = {2005},
editor = {G. Kendall and L. Lei and M. Pinedo},
pages = {123--131},
note = {Paper},
abstract = {In this paper we consider the solution of an uniform parallel machine scheduling problem with two criteria. The aim is to minimise the makespan as well as the maximum lateness of jobs. We first propose a heuristic by progressive construction which tries to solve the problem without studing all possible solutions. An efficient branch-and-bound algorithm to compute a strict Pareto optimum is presented. In this method we introduce the preemptive feasibility test and energetic test which are used to prune nodes in the search tree. We have also integrated other methods in this branch-and-bound algorithm to reduce the search space.},
owner = {Faizah Hamdan},
timestamp = {2012.05.21},
webpdf = {2005-123-131-P.pdf} }