A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\)

DOI10.1007/s10878-020-00593-1zbMath1503.90048OpenAlexW3033407161MaRDI QIDQ2084601

Yinling Wang, Yong Piao, Xin Han, Yan Lan, Xin Chen

Publication date: 18 October 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-020-00593-1

zbMATH Keywords

approximation algorithmbin packingscheduling with transportation

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

Flow shop scheduling problems with transportation constraints revisited

Cites Work

• Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\)
• Machine scheduling with deliveries to multiple customer locations
• On the machine scheduling problem with job delivery coordination
• Complexity of problem \(TF2|v=1,c=2|C_{\max}\)
• A new heuristic algorithm for the machine scheduling problem with job delivery coordination
• Heuristics for parallel machine scheduling with delivery times
• Machine scheduling with job delivery coordination
• Scheduling with batching: A review
• Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
• ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER
• Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling Groups of Jobs on a Single Machine
• Machine scheduling with transportation considerations
• Makespan minimization for flow-shop problems with transportation times and a single robot
• Unnamed Item

This page was built for publication: A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\)