Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries
From MaRDI portal
Publication:763109
DOI10.1007/s10479-011-1000-6zbMath1233.90171OpenAlexW2055312886MaRDI QIDQ763109
Publication date: 9 March 2012
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-011-1000-6
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)
Related Items (8)
Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work ⋮ Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs ⋮ A new perspective on single-machine scheduling problems with late work related criteria ⋮ Capacity optimization and competition with cyclical and lead-time-dependent demands ⋮ Scheduling problems with position dependent job processing times: computational complexity results ⋮ Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling ⋮ Due-date assignment for multi-server multi-stage assembly systems ⋮ Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains
Cites Work
- Manufacturing lead-time rules: customer retention versus tardiness costs
- The coordination of scheduling and batch deliveries
- The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
- Fast approximation algorithm for job sequencing with deadlines
- Coordinated supply chain management
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Improving the complexities of approximation algorithms for optimization problems
- Scheduling with batching: A review
- Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains
- An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure
- Batch scheduling and common due-date assignment on a single machine
- Supply Chain Scheduling: Batching and Delivery
- Algorithms for Scheduling Independent Tasks
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Parallel Processing and Applied Mathematics
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries
