Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties
From MaRDI portal
Publication:2228360
DOI10.1007/s11590-019-01462-5zbMath1459.90101OpenAlexW2968430199MaRDI QIDQ2228360
Publication date: 17 February 2021
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-019-01462-5
Related Items (3)
A variable neighborhood search algorithm for a PET/CT examination scheduling problem considering multi-stage process and deteriorating effect ⋮ A heuristic for single machine common due date assignment problem with different earliness/tardiness weights ⋮ Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection
Cites Work
- Unnamed Item
- Batch machine production with perishability time windows and limited batch size
- Bicriterion scheduling with equal processing times on a batch processing machine
- Due dates assignment and JIT scheduling with equal-size jobs
- FPTAS for half-products minimization with scheduling applications
- Survey of scheduling research involving due date determination decisions
- Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
- Completion time variance minimization on a single machine is difficult
- Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Single machine scheduling to minimize the number of early and tardy jobs
- Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs
- A survey on scheduling problems with due windows
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
- Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
- Minimization of Half-Products
- Sequencing with Earliness and Tardiness Penalties: A Review
- MINIMIZING TOTAL WEIGHTED EARLINESS-TARDINESS ON A SINGLE MACHINE AROUND A SMALL COMMON DUE DATE: AN FPTAS USING QUADRATIC KNAPSACK
- Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- On the Minimization of Completion Time Variance with a Bicriteria Extension
- A Fully Polynomial Approximation Scheme for the Weighted Earliness–Tardiness Problem
This page was built for publication: Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties
