Solving scheduling problems using Petri nets and constraint logic programming
P. Richard, C. Proust (1998)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Displaying similar documents to “A new formulation for scheduling unrelated processor under precedence constraints”
Solving scheduling problems using Petri nets and constraint logic programming
Advanced search techniques for the job shop problem : a comparison
R. Tadei, F. Della Croce, G. Menga (1995)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
A new class of scheduling criteria and their optimization
Chengbin Chu (1996)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
A new formulation for scheduling unrelated processor under precedence constraints
Nelson Maculan, Stella C.S. Porto, Celso C. Ribeiro, Cid Carvalho de Souza (2010)
RAIRO - Operations Research
Similarity:
We give a new formulation for the problem of task scheduling into unrelated processors under precedence constraints. This formulation has a polynomial number of variables and does not require that the processing times be integer valued.
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:
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.