The following pages link to Jacek Błażewicz (Q224835):
Displayed 50 items.
- Solving the resource constrained deadline scheduling problem via reduction to the network flow problem (Q1147628) (← links)
- A pointer-free data structure for merging heaps and min-max heaps (Q1177934) (← links)
- Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling (Q1183390) (← links)
- Stability of an optimal schedule (Q1183618) (← links)
- Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource (Q1186309) (← links)
- Scheduling with release dates on a single machine to minimize total weighted completion time (Q1193720) (← links)
- Dynamic programming algorithm for a FMS scheduling problem (Q1197593) (← links)
- Optimization aspects of deadlock prevention in packet-switching networks (Q1197951) (← links)
- Scheduling multiprocessor tasks on three dedicated processors (Q1197982) (← links)
- Simple algorithms for multiprocessor scheduling to meet deadlines (Q1248336) (← links)
- Deadline scheduling of tasks with ready times and resource constraints (Q1255432) (← links)
- Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness (Q1261479) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- Scheduling multiprocessor tasks with chain constraints (Q1278298) (← links)
- Divisible task scheduling -- concept and verification: Special issue on task scheduling problems for parallel and distributed systems (Q1285553) (← links)
- Scheduling a divisible task in a two-dimensional toroidal mesh (Q1293188) (← links)
- A note on disjunctive graph representation (Q1307847) (← links)
- Scheduling independent multiprocessor tasks on a uniform \(k\)-processor system (Q1315909) (← links)
- Corrigendum to: ``Scheduling multiprocessor tasks on three dedicated processors'' (Q1318754) (← links)
- Graph theoretical issues in computer networks (Q1319540) (← links)
- Scheduling jobs with release times on a machine with finite storage (Q1330556) (← links)
- Scheduling with resource management in manufacturing systems (Q1331541) (← links)
- Vehicle scheduling in two-cycle flexible manufacturing systems (Q1341395) (← links)
- On the recognition of de Bruijn graphs and their induced subgraphs (Q1348115) (← links)
- Scheduling complete intrees on two uniform processors with communication delays (Q1349970) (← links)
- Distributed processing of divisible jobs with communication startup costs (Q1363737) (← links)
- Preemptive multiprocessor task scheduling with release times and time windows (Q1374419) (← links)
- Scheduling multiprocessor tasks on parallel processors with limited availability. (Q1399581) (← links)
- Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop. (Q1399584) (← links)
- An iterative algorithm for scheduling UET tasks with due dates and release times. (Q1399585) (← links)
- Complexity of DNA sequencing by hybridization. (Q1401172) (← links)
- Open shop scheduling problems with late work criteria. (Q1421458) (← links)
- Scheduling preemptable tasks on parallel processors with limited availability (Q1575603) (← links)
- Parallel branch and bound algorithms for the two-machine flow shop problem with limited machine availability (Q1578308) (← links)
- Tabu search for DNA sequencing with false negatives and false positives (Q1580973) (← links)
- The disjunctive graph machine representation of the job shop scheduling problem (Q1590037) (← links)
- Complexity of some special types of timetabling problems (Q1600003) (← links)
- From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective (Q1600095) (← links)
- Linear and quadratic algorithms for scheduling chains and opposite chains (Q1600834) (← links)
- On-line scheduling with precedence constraints (Q1602711) (← links)
- A tabu search algorithm for scheduling a single robot in a job-shop environment (Q1602712) (← links)
- Graph algorithms for DNA sequencing -- origins, current models and the future (Q1681385) (← links)
- G-MAPSEQ -- a new method for mapping reads to a reference genome (Q1692074) (← links)
- Scheduling on parallel identical machines with late work criterion: offline and online cases (Q1702733) (← links)
- An integrated model for the transshipment yard scheduling problem (Q1707671) (← links)
- Detecting life signatures with RNA sequence similarity measures (Q1717070) (← links)
- A reduced load approximation accounting for link interactions in a loss network (Q1769998) (← links)
- The two-machine flow-shop problem with weighted late work criterion and common due date (Q1772844) (← links)
- (Q1801673) (redirect page) (← links)
- Addendum: Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource (Q1801674) (← links)