scientific article; zbMATH DE number 2051966
From MaRDI portal
Publication:4453997
zbMATH Open1053.90105MaRDI QIDQ4453997
Publication date: 7 March 2004
Title of this publication is not available (Why is that?)
Semidefinite programming (90C22) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)
Related Items (10)
Title not available (Why is that?) ⋮ Approximation schemes for parallel machine scheduling problems with controllable processing times ⋮ An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints ⋮ A Worst-case Performance of the Shortest-processing-time Heuristic for Single Machine Scheduling ⋮ Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness ⋮ Approximation algorithms for inventory constrained scheduling on a single machine ⋮ Single machine scheduling with total tardiness criterion and convex controllable processing times ⋮ Scheduling two projects with controllable processing times in a single-machine environment ⋮ Title not available (Why is that?) ⋮ A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4453997)
