The following pages link to (Q3840372):
Displaying 17 items.
- Optimal restricted due date assignment in scheduling (Q322834) (← links)
- Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope (Q323058) (← links)
- Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay. (Q703281) (← links)
- Approximation algorithms for shop scheduling problems with minsum objective (Q1607979) (← links)
- Polynomial time approximation algorithms for machine scheduling: Ten open problems (Q1806342) (← links)
- Precedence constrained scheduling to minimize sum of weighted completion times on a single machine (Q1961232) (← links)
- Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates (Q2294224) (← links)
- Worst case analysis of decomposed software pipelining for cyclic unitary RCPSP with precedence delays (Q2434252) (← links)
- Approximation algorithms for scheduling problems with a modified total weighted tardiness objective (Q2465959) (← links)
- Designing PTASs for MIN-SUM scheduling problems (Q2489956) (← links)
- Performance of Garey-Johnson algorithm for pipelined typed tasks systems (Q3002561) (← links)
- Decomposition Algorithm for the Single Machine Scheduling Polytope (Q3195338) (← links)
- A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints (Q3602833) (← links)
- Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints (Q5060512) (← links)
- An improved approximation algorithm for scheduling under arborescence precedence constraints (Q5089259) (← links)
- Non-Clairvoyant Precedence Constrained Scheduling. (Q5091220) (← links)
- Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations (Q5117378) (← links)
