A tight approximation algorithm for problem P2 D|v=1,c=1|C_
From MaRDI portal
Publication:2084601
Recommendations
- Parallel machine scheduling with job delivery coordination
- On the machine scheduling problem with job delivery coordination
- Two parallel machines scheduling with two-vehicle job delivery to minimize makespan
- The Coordination of Two Parallel Machines Scheduling and Batch Deliveries
- Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination
Cites work
- A new heuristic algorithm for the machine scheduling problem with job delivery coordination
- An improved algorithm for scheduling two identical machines with batch delivery consideration
- Complexity of problem \(TF2|v=1,c=2|C_{\max}\)
- Heuristics for parallel machine scheduling with delivery times
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Jackson's Rule for Single-Machine Scheduling: Making a Good Heuristic Better
- Machine scheduling with deliveries to multiple customer locations
- Machine scheduling with job delivery coordination
- Machine scheduling with transportation considerations
- Makespan minimization for flow-shop problems with transportation times and a single robot
- ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER
- On the machine scheduling problem with job delivery coordination
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling Groups of Jobs on a Single Machine
- Scheduling with batching: A review
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\)
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
Cited in
(15)- An \(O(mn^ 2)\) algorithm for the maximin problem in \(E^ 2\)
- A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem
- Two faster algorithms for coordination of production and batch delivery: a note
- A scheme of approximation solution of problem 1 |r j|L max
- The Coordination of Two Parallel Machines Scheduling and Batch Deliveries
- Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination
- scientific article; zbMATH DE number 1226311 (Why is no real title available?)
- scientific article; zbMATH DE number 6129431 (Why is no real title available?)
- A (1.4 + epsilon)-Approximation Algorithm for the 2-Max-Duo Problem
- Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time
- Flow shop scheduling problems with transportation constraints revisited
- An improved approximation algorithm for a scheduling problem with transporter coordination
- An adaptive large neighborhood search for unrelated parallel machine scheduling with setup times and delivery times
- On the machine scheduling problem with job delivery coordination
- Complexity of problem \(TF2|v=1,c=2|C_{\max}\)
This page was built for publication: A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2084601)
