Results 241 to 250 of about 1,257,183 (296)
Single-Machine Scheduling with Multi-Criteria and Due- Windows. [PDF]
F1000ResMohsin DA, Mohammed HAA.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures - SPAA '94, 1994
We give distributed approximation algorithms for job scheduling in a ring architecture. In contrast to almost all other parallel scheduling models, the model we consider captures the influence of the underlying communications network by specifying that task migration from one processor to another takes time proportional to the distance between those ...
Perry Fizzano +3 more
openaire +2 more sources
We give distributed approximation algorithms for job scheduling in a ring architecture. In contrast to almost all other parallel scheduling models, the model we consider captures the influence of the underlying communications network by specifying that task migration from one processor to another takes time proportional to the distance between those ...
Perry Fizzano +3 more
openaire +2 more sources
Scheduling Jobs on Grid Processors
Algorithmica, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Joan Boyar, Lene M. Favrholdt
openaire +3 more sources
Job Scheduling in Mesh Multicomputers
1994 International Conference on Parallel Processing (ICPP'94), 1994A new approach for dynamic job scheduling in mesh-connected multiprocessor system, which supports a multi-user environment, is proposed. The proposed job scheduler combines a priority-based scheduling policy with a submesh reservation policy to obtain high performance in terms of high throughput, high utilization and low turn-around times for jobs. The
Debendra Das Sharma, Dhiraj K. Pradhan
openaire +2 more sources
Job Shop Scheduling With Deadlines
Journal of Combinatorial Optimization, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BALAS E. +3 more
openaire +3 more sources
Cyclic Schedules for Job Shops with Identical Jobs
Mathematics of Operations Research, 1992We consider the problem of finding cyclic schedules for a job shop in which all jobs are identical. Specifically, we assume that a single product is produced on a finite number of machines. Each part is manufactured by performing a given set of operations in a pre-determined sequence. Each operation can be performed on exactly one machine.
openaire +3 more sources
Job shop scheduling with the option of jobs outsourcing
International Journal of Production Research, 2019Incorporating outsourcing in scheduling is addressed by several researchers recently. However, this scope is not investigated thoroughly, particularly in the job shop environment.
Hamid Safarzadeh, Farhad Kianfar
openaire +2 more sources
Scheduling fully parallel jobs
Journal of Scheduling, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kai Wang 0018, Vincent Chau, Minming Li
openaire +2 more sources
Scheduling job shops with delays
Proceedings. 1987 IEEE International Conference on Robotics and Automation, 1991In this paper, the presence of delay in a job shop is addressed. We show that delay is an important consideration in many manufacturing systems that are modeled as continuous flow processes. A scheduling policy for a job shop with delays is then derived using theoretical arguments and heuristics.
Sheldon X. C. Lou +2 more
openaire +2 more sources
On the Placement of Reservations into Job Schedules
2006We present a new method for determining placements of flexible reservation requests into a schedule. For each considered placement the what-if method inserts a placeholder into the schedule and simulates the processing of batch jobs currently known to the system. Each placement is evaluated wrt. well-known scheduling metrics.
Thomas Röblitz, Krzysztof Rzadca
openaire +1 more source