On the application of insertion techniques for job shop problems with setup times
Yuri N. Sotskov, Thomas Tautenhahn, Frank Werner (1999)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Yuri N. Sotskov, Thomas Tautenhahn, Frank Werner (1999)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Mohamed Haouari, Thouraya Daouas (1999)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
R. Tadei, F. Della Croce, G. Menga (1995)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Heidemarie Bräsel, Dagmar Kluge, Frank Werner (1996)
RAIRO - Operations Research - Recherche Opérationnelle
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...
Nelson Maculan, Stella C. S. Porto, Celso C. Ribeiro, Cid Carvalho de Souza (1999)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Jacques Carlier, Emmanuel Néron (2000)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Jatinder N. D. Gupta (1976)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Jacek Błażewicz, Piotr Formanowicz (2002)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
In this paper, open shop scheduling problems with limited machine availability are studied. Such a limited availability of machines may appear in many real-life situations, e.g. as preventive maintenance activities. Three types of jobs are distinguished: non-preemptable, resumable and preemptable. An operation of a resumable job if not completed before a non-availability period of a machine may be suspended and continued without additional cost when the machine becomes available. In...
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...