Scheduling with job delivery coordination on single machine
From MaRDI portal
Publication:1744622
DOI10.1007/s11590-017-1139-4zbMath1400.90168OpenAlexW2605025702MaRDI QIDQ1744622
Publication date: 19 April 2018
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-017-1139-4
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
Two parallel machines scheduling with two-vehicle job delivery to minimize makespan ⋮ Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
Cites Work
- Unnamed Item
- Unnamed Item
- Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\)
- An improved approximation algorithm for single machine scheduling with job delivery
- Improved algorithms for two single machine scheduling problems
- On the machine scheduling problem with job delivery coordination
- Machine scheduling with job delivery coordination
- Coordinating multi-location production and customer delivery
- Single machine scheduling with release dates and job delivery to minimize the makespan
- Integrated Production and Outbound Distribution Scheduling: Review and Extensions
- Machine Scheduling with a Maintenance Interval and Job Delivery Coordination
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Combinatorial optimization. Theory and algorithms.
- Machine scheduling with transportation considerations
This page was built for publication: Scheduling with job delivery coordination on single machine
