An approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties
From MaRDI portal
Publication:6566793
DOI10.1007/S40305-022-00430-8MaRDI QIDQ6566793
Bo Hou, Wen Liu, Hong-Ye Zheng, Suogang Gao
Publication date: 3 July 2024
Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Approximation algorithms for submodular vertex cover problems with linear/submodular penalties using primal-dual technique
- Parallel-machine scheduling with release dates and rejection
- Improved approximation algorithms for parallel machine scheduling with release dates and job rejection
- Parallel-machine scheduling with deteriorating jobs and rejection
- Minimizing maximum delivery completion time for order scheduling with rejection
- Order scheduling in an environment with dedicated resources in parallel
- Approximation algorithms for precedence-constrained identical machine scheduling with rejection
- Approximation algorithms for the multiprocessor scheduling with submodular penalties
- Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties
- A primal-dual approximation algorithm for the facility location problem with submodular penalties
- Scheduling orders for multiple product types with due date related objectives
- Submodular functions and optimization.
- Multiprocessor Scheduling with Rejection
This page was built for publication: An approximation algorithm for the parallel-machine customer order scheduling with delivery time and submodular rejection penalties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566793)
