scientific article; zbMATH DE number 167292
From MaRDI portal
Publication:4034337
zbMATH Open0795.68135MaRDI QIDQ4034337FDOQ4034337
Authors: Jinjiang Yuan 
Publication date: 16 May 1993
Title of this publication is not available (Why is that?)
Cited In (28)
- Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
- A dynamic programming algorithm for scheduling problems on earliness award and tardiness penalty with time-dependent processing time
- A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
- Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty
- An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates
- On the local dominance properties in single machine scheduling problems
- NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time
- Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem
- Scheduling jobs with a V-shaped time-dependent processing time
- The symmetric quadratic knapsack problem: approximation and scheduling applications
- On the complexity of the single machine scheduling problem minimizing total weighted delay penalty
- The weighted common due date single machine scheduling problem revisited
- Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates
- Just-in-Time Scheduling with Equal-Size Jobs
- Optimal restricted due date assignment in scheduling
- Unary NP-hardness of minimizing total weighted tardiness with generalized due dates
- Single machine scheduling with controllable release and processing parameters
- A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines
- Minsum scheduling with acceptable lead-times and optional job rejection
- Scheduling with generalized and periodic due dates under single- and two-machine environments
- Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments
- Min–max version of single-machine scheduling with generalized due dates under scenario-based uncertainty
- A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
- Single machine scheduling to minimize total weighted tardiness
- Dual Techniques for Scheduling on a Machine with Varying Speed
- Approximation algorithms for minimizing the total weighted tardiness on a single machine
- Just-In-Time Scheduling with Generalized Due Dates and Identical Due Date Intervals
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)
