On a machine sequencing problem (I)
J. Grabowski, M. M. Sysło (1973)
Applicationes Mathematicae
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
J. Grabowski, M. M. Sysło (1973)
Applicationes Mathematicae
Similarity:
M. M. Sysło (1974)
Applicationes Mathematicae
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...
Commander Anil Rana, Ajit Verma, As Srividya (2010)
The Yugoslav Journal of Operations Research
Similarity:
J. Hartmanis (1976)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
V. J. Rayward-Smith, D. Rebaine (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Yuri N. Sotskov, Thomas Tautenhahn, Frank Werner (1999)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Mirosław Gajer (2004)
Control and Cybernetics
Similarity: