scientific article; zbMATH DE number 167292
From MaRDI portal
Publication:4034337
Cited in
(28)- On the local dominance properties in single machine scheduling problems
- Minsum scheduling with acceptable lead-times and optional job rejection
- Just-in-time scheduling with generalized due dates and identical due date intervals
- Scheduling jobs with a V-shaped time-dependent processing time
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
- Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
- An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates
- Scheduling with generalized and periodic due dates under single- and two-machine environments
- Single machine scheduling with controllable release and processing parameters
- Dual techniques for scheduling on a machine with varying speed
- Approximation algorithms for minimizing the total weighted tardiness on a single machine
- Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty
- Just-in-time scheduling with equal-size jobs
- Single machine scheduling to minimize total weighted tardiness
- A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines
- The weighted common due date single machine scheduling problem revisited
- Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments
- NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time
- Two-machine ordered flow shop scheduling with generalized due dates
- Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty
- Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem
- A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs
- Optimal restricted due date assignment in scheduling
- On the complexity of the single machine scheduling problem minimizing total weighted delay penalty
- The symmetric quadratic knapsack problem: approximation and scheduling applications
- Unary NP-hardness of minimizing total weighted tardiness with generalized due dates
- A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
- A dynamic programming algorithm for scheduling problems on earliness award and tardiness penalty with time-dependent processing time
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 Q4034337)
