Polynomial time algorithms for special open shop problems with precedence constraints and unit processing times
Heidemarie Bräsel, Dagmar Kluge, Frank Werner (1996)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Heidemarie Bräsel, Dagmar Kluge, Frank Werner (1996)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Frank Werner (1990)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Jacek Błażewicz, Paolo Dell'Olmo, Maciej Drozdowski (2002)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
In this work scheduling multiprocessor tasks on two parallel identical processors is considered. Multiprocessor tasks can be executed by more than one processor at the same moment of time. We analyze scheduling unit execution time and preemptable tasks to minimize schedule length and maximum lateness. Cases with ready times, due-dates and precedence constraints are discussed.
R. Tadei, F. Della Croce, G. Menga (1995)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Ivan Stanimirović, Marko Petković, Predrag Stanimirović, Miroslav Ćirić (2009)
The Yugoslav Journal of Operations Research
Similarity:
Peng Wuliang, Huang Min, Hao Yongping (2014)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Many real-world scheduling problems can be modeled as Multi-mode Resource Constrained Project Scheduling Problems (MRCPSP). However, the MRCPSP is a strong NP-hard problem and very difficult to be solved. The purpose of this research is to investigate a more efficient alternative based on ant algorithm to solve MRCPSP. To enhance the generality along with efficiency of the algorithm, the rule pool is designed to manage numerous priority rules for MRCPSP. Each ant is provided with an...
A. Adrabiński, M. Wodecki (1979)
Applicationes Mathematicae
Similarity:
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...
Abdellah Salhi, George R. Lindfield (1991)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
É. D. Taillard (1999)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Renaud Sirdey, Hervé L. M. Kerivin (2007)
RAIRO - Operations Research
Similarity:
This paper is devoted to the exact resolution of a strongly -hard resource-constrained scheduling problem, the , which arises in relation to the operability of certain high-availability real-time distributed systems. Based on the study of the polytope defined as the convex hull of the incidence vectors of the admissible process move programs, we present a branch-and-cut algorithm along with extensive computational results demonstrating its practical relevance, in terms of both exact...