Optimal scheduling of the -machine assembly-type flow shop
Mohamed Haouari, Thouraya Daouas (1999)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Mohamed Haouari, Thouraya Daouas (1999)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
V. J. Rayward-Smith, D. Rebaine (1992)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Jacques Carlier, Emmanuel Néron (2000)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Yuri N. Sotskov, Thomas Tautenhahn, Frank Werner (1999)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Jan Pelikán (2011)
Kybernetika
Similarity:
The subject of this paper is a flow-shop based on a case study aimed at the optimisation of ordering production jobs in mechanical engineering, in order to minimize the overall processing time, the makespan. The production jobs are processed by machines, and each job is assigned to a certain machine for technological reasons. Before processing a job, the machine has to be adjusted; there is only one adjuster who adjusts all of the machines. This problem is treated as a hybrid two-stage...
C. L. Monma, A. H. G. Rinnooy Kan (1983)
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...