Displaying similar documents to “Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions”

Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions

Imed Kacem, Nizar Souayah, Mohamed Haouari (2012)

RAIRO - Operations Research

Similarity:

This paper deals with the parallel-machine scheduling problem with the aim of minimizing the total (weighted) tardiness under the assumption of different release dates. This problem has been proven to be NP-hard. We introduce some new lower and upper bounds based on different approaches. We propose a branch-and-bound algorithm to solve the weighted and unweighted total tardiness. Computational experiments were performed on a large set of ...

New lower bounds on the weighted chromatic number of a graph

Massimiliano Caramia, Jirí Fiala (2004)

Discussiones Mathematicae Graph Theory

Similarity:

In this paper we present theoretical and algorithmic results for the computation of lower bounds on the chromatic number of a weighted graph. In particular, we study different ways of a possible improvement of the lower bound offered by a maximum weighted clique. Based on our findings we devise new algorithms and show their performance on random graphs.

Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervals

Valery S. Gordon, F. Werner, O. A. Yanushkevich (2001)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

This paper is devoted to the following version of the single machine preemptive scheduling problem of minimizing the weighted number of late jobs. A processing time, a release date, a due date and a weight of each job are given. Certain jobs are specified to be completed in time, i.e., their due dates are assigned to be deadlines, while the other jobs are allowed to be completed after their due dates. The release/due date intervals are nested, i.e., no two of them overlap (either they...

Multicriteria scheduling problems : a survey

V. T'kindt, J.-C. Billaut (2001)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

This paper presents a state-of-the-art survey on multicriteria scheduling and introduces a definition of a multicriteria scheduling problem. It provides a framework that allows to tackle multicriteria scheduling problems, according to Decision Aid concepts. This problem is decomposed into three different problems. The first problem is about obtaining a model. The second one is how to take criteria into account and the third one is about solving a scheduling problem. An extension to an...

Lower bounds for the scheduling problem with uncertain demands

Djamel Berkoune, Khaled Mesghouni, Besoa Rabenasolo (2006)

International Journal of Applied Mathematics and Computer Science

Similarity:

This paper proposes various lower bounds to the makespan of the flexible job shop scheduling problem (FJSP). The FJSP is known in the literature as one of the most difficult combinatorial optimisation problems (NP-hard). We will use genetic algorithms for the optimisation of this type of problems. The list of the demands is divided in two sets: the actual demand, which is considered as certain (a list of jobs with known characteristics), and the predicted demand, which is a list of uncertain...

Reservation table scheduling: branch-and-bound based optimization . integer linear programming techniques

Hadda Cherroun, Alain Darte, Paul Feautrier (2007)

RAIRO - Operations Research

Similarity:

The recourse to operation research solutions has strongly increased the performances of scheduling task in the High-Level Synthesis (called hardware compilation). Scheduling a whole program is not possible as too many constraints and objectives interact. We decompose high-level scheduling in three steps. Step 1: Coarse-grain scheduling tries to exploit parallelism and locality of the whole program (in particular in loops, possibly imperfectly nested) with a rough view of the target...

Weighted composition operators on weighted Lorentz spaces

İlker Eryilmaz (2012)

Colloquium Mathematicae

Similarity:

The boundedness, compactness and closedness of the range of weighted composition operators acting on weighted Lorentz spaces L(p,q,wdμ) for 1 < p ≤ ∞, 1 ≤ q ≤ ∞ are characterized.