scientific article
From MaRDI portal
Publication:4034337
zbMath0795.68135MaRDI QIDQ4034337
Publication date: 16 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (26)
Minsum scheduling with acceptable lead-times and optional job rejection ⋮ Approximation algorithms for minimizing the total weighted tardiness on a single machine ⋮ Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications ⋮ Dual Techniques for Scheduling on a Machine with Varying Speed ⋮ Optimal restricted due date assignment in scheduling ⋮ NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time ⋮ A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date ⋮ Just-In-Time Scheduling with Generalized Due Dates and Identical Due Date Intervals ⋮ A dynamic programming algorithm for scheduling problems on earliness award and tardiness penalty with time-dependent processing time ⋮ An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates ⋮ The symmetric quadratic knapsack problem: approximation and scheduling applications ⋮ 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 with controllable release and processing parameters ⋮ Scheduling jobs with a V-shaped time-dependent processing time ⋮ Approximation algorithms for scheduling problems with a modified total weighted tardiness objective ⋮ Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments ⋮ Single machine scheduling to minimize total weighted tardiness ⋮ On the complexity of the single machine scheduling problem minimizing total weighted delay penalty ⋮ Unary NP-hardness of minimizing total weighted tardiness with generalized due dates ⋮ Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem ⋮ Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates ⋮ A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs ⋮ A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines ⋮ Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty ⋮ Scheduling with generalized and periodic due dates under single- and two-machine environments
This page was built for publication:
