scientific article
From MaRDI portal
Publication:3840372
zbMath0911.90215MaRDI QIDQ3840372
Maurice Queyranne, Andreas S. Schulz, Alix Munier
Publication date: 10 August 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Scheduling Parallel-Task Jobs Subject to Packing and Placement Constraints ⋮ Optimal restricted due date assignment in scheduling ⋮ Efficient implementation of Carathéodory's theorem for the single machine scheduling polytope ⋮ Decomposition Algorithm for the Single Machine Scheduling Polytope ⋮ Scheduling to Minimize Total Weighted Completion Time via Time-Indexed Linear Programming Relaxations ⋮ Worst case analysis of decomposed software pipelining for cyclic unitary RCPSP with precedence delays ⋮ Precedence constrained scheduling to minimize sum of weighted completion times on a single machine ⋮ Performance of Garey-Johnson algorithm for pipelined typed tasks systems ⋮ Approximation algorithms for scheduling problems with a modified total weighted tardiness objective ⋮ Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay. ⋮ Designing PTASs for MIN-SUM scheduling problems ⋮ A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints ⋮ Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates ⋮ Polynomial time approximation algorithms for machine scheduling: Ten open problems ⋮ An improved approximation algorithm for scheduling under arborescence precedence constraints ⋮ Non-Clairvoyant Precedence Constrained Scheduling. ⋮ Approximation algorithms for shop scheduling problems with minsum objective
This page was built for publication:
