The following pages link to (Q3821925):
Displaying 45 items.
- Project scheduling with finite or infinite number of activity processing modes -- a survey (Q621683) (← links)
- Tight complexity analysis of the relocation problem with arbitrary release dates (Q638514) (← links)
- The cyclic compact open-shop scheduling problem (Q686491) (← links)
- Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems (Q721682) (← links)
- Mathematical programming formulations for machine scheduling: A survey (Q811337) (← links)
- Computing redundant resources for the resource constrained project scheduling problem (Q853022) (← links)
- On relocation problems with multiple identical working crews (Q865754) (← links)
- Maximizing system lifetime in wireless sensor networks (Q872283) (← links)
- Faster and simpler approximation algorithms for mixed packing and covering problems (Q884474) (← links)
- Almost nonpreemptive schedules (Q922279) (← links)
- On the two-phase method for preemptive scheduling (Q1107434) (← links)
- Real-time scheduling of an automated manufacturing center (Q1116883) (← links)
- Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource (Q1186309) (← links)
- Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems (Q1266535) (← links)
- Extensions of coloring models for scheduling purposes (Q1268282) (← links)
- Heuristics for multimode scheduling problems with dedicated resources (Q1296081) (← links)
- The complexity of scheduling jobs in repetitive manufacturing systems (Q1310021) (← links)
- Open shops with jobs overlap (Q1319530) (← links)
- On the complexity of preemptive openshop scheduling problems (Q1333531) (← links)
- DSS for multiobjective project scheduling (Q1342057) (← links)
- Preassignment requirements in chromatic scheduling (Q1363744) (← links)
- A variant of the permutation flow shop model with variable processing times (Q1363747) (← links)
- On linear lower bounds for the resource constrained project scheduling problem. (Q1399576) (← links)
- Approximate strong separation with application in fractional graph coloring and preemptive scheduling. (Q1401329) (← links)
- Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints. (Q1413824) (← links)
- Scheduling problems for parallel dedicated machines under multiple resource constraints. (Q1417559) (← links)
- Flow shop scheduling problem with conflict graphs (Q1708533) (← links)
- Restricted assignment scheduling with resource constraints (Q1713408) (← links)
- Resource-constrained flowshop scheduling with separate resource recycling operations (Q1762095) (← links)
- Algorithms for minimizing maximum lateness with unit length tasks and resource constraints (Q1803669) (← links)
- The multi-mode resource-constrained project scheduling problem with generalized precedence relations (Q1807061) (← links)
- Exploiting process plan flexibility in production scheduling: A multi-objective approach (Q1809824) (← links)
- Restrictions and preassignments in preemptive open shop scheduling (Q1917354) (← links)
- UET-scheduling with chain-type precedence constraints (Q1919973) (← links)
- New complexity results for shop scheduling problems with agreement graphs (Q2232609) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- Two-machine open shop problem with agreement graph (Q2333794) (← links)
- Parallel machine scheduling with additional resources: notation, classification, models and solution methods (Q2356015) (← links)
- Open shop scheduling problems with conflict graphs (Q2357137) (← links)
- Multiprocessor scheduling under precedence constraints: polyhedral results (Q2489902) (← links)
- A preemptive open shop scheduling problem with one resource (Q2641218) (← links)
- Scheduling Multilayer Divisible Computations (Q5247698) (← links)
- Handbook on Scheduling (Q5754725) (← links)
- A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan (Q6164629) (← links)
- An integrated approach for allocation and scheduling-location problems on graphs (Q6543758) (← links)
