On a machine sequencing problem (I)
J. Grabowski, M. M. Sysło (1973)
Applicationes Mathematicae
Similarity:
Displaying similar documents to “On some machine sequencing problems (II)”
On a machine sequencing problem (I)
Refactorable numbers -- a machine invention.
Colton, Simon (1999)
Journal of Integer Sequences [electronic only]
Similarity:
Scheduling jobs in open shops with limited machine availability
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...
Optimisation of Production Machine Scheduling Using a Two Level Mixed Optimisation Method
Commander Anil Rana, Ajit Verma, As Srividya (2010)
The Yugoslav Journal of Operations Research
Similarity:
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:
General time schedule
Similarity:
Optimal scheduling of the -machine assembly-type flow shop
Mohamed Haouari, Thouraya Daouas (1999)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
UET flow shop scheduling with delays
V. J. Rayward-Smith, D. Rebaine (1996)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Scheduling multiprocessor tasks on two parallel processors
Jacek Błażewicz, Paolo Dell'Olmo, Maciej Drozdowski (2010)
RAIRO - Operations Research
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.