Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties
From MaRDI portal
Publication:2228360
Recommendations
- Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
- The weighted common due date single machine scheduling problem revisited
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Scheduling to minimize weighted earliness and tardiness about a common due-date
- scientific article; zbMATH DE number 434689
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
- A survey of the state-of-the-art of common due date assignment and scheduling research
- A survey on scheduling problems with due windows
- Batch machine production with perishability time windows and limited batch size
- Bicriterion scheduling with equal processing times on a batch processing machine
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Completion time variance minimization on a single machine is difficult
- Due dates assignment and JIT scheduling with equal-size jobs
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- FPTAS for half-products minimization with scheduling applications
- Minimization of half-products
- Minimizing total weighted earliness-tardiness on a single machine around a small common due date: an FPTAS using quadratic knapsack
- Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs
- Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
- On the Minimization of Completion Time Variance with a Bicriteria Extension
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
- Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
- Sequencing with Earliness and Tardiness Penalties: A Review
- Single machine scheduling to minimize the number of early and tardy jobs
- Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs
- Survey of scheduling research involving due date determination decisions
Cited in
(12)- A note: minmax due-window assignment with fixed earliness-tardiness costs
- A variable neighborhood search algorithm for a PET/CT examination scheduling problem considering multi-stage process and deteriorating effect
- Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection
- Scheduling Unit Jobs with a Common Deadline to Minimize the Sum of Weighted Completion Times and Rejection Penalties
- Minmax scheduling problems with common due-date and completion time penalty
- Scheduling to minimize weighted earliness and tardiness about a common due-date
- A heuristic for single machine common due date assignment problem with different earliness/tardiness weights
- A dual criteria sequencing problem with earliness and tardiness penalties
- Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty
- Common due date assignment and single-machine scheduling with release times to minimize the weighted number of tardy jobs
- Common due date assignment and scheduling with ready times
- A dynamic programming algorithm for scheduling problems on earliness award and tardiness penalty with time-dependent processing time
This page was built for publication: Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2228360)
