On the machine scheduling problem with job delivery coordination
From MaRDI portal
Recommendations
- Scheduling with job delivery coordination on single machine
- Machine scheduling with job delivery coordination
- Parallel machine scheduling with job delivery coordination
- Machine scheduling with a maintenance interval and job delivery coordination
- A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\)
Cites work
- A simple proof of the inequality \(\text{FFD}(L)\leq {11 \over 9} \text{OPT}(L)+1\), \(\forall L\) for the FFD bin-packing algorithm
- Fast Approximation Algorithms for Knapsack Problems
- scientific article; zbMATH DE number 563208 (Why is no real title available?)
- scientific article; zbMATH DE number 1182767 (Why is no real title available?)
- Improved algorithms for two single machine scheduling problems
- Integrated Scheduling of Production and Distribution Operations
- Machine scheduling with deliveries to multiple customer locations
- Machine scheduling with job delivery coordination
- Machine scheduling with transportation considerations
Cited in
(42)- A new heuristic algorithm for the machine scheduling problem with job delivery coordination
- Scheduling with families of jobs and delivery coordination under job availability
- Single machine scheduling with job delivery to multiple customers
- Online scheduling on a single machine with grouped processing times
- Scheduling with job delivery coordination on single machine
- Machine scheduling with job delivery coordination
- Coordinating multi-location production and customer delivery
- Unbounded parallel-batch scheduling with family jobs and delivery coordination
- Single bounded parallel-batch machine scheduling with an unavailability constraint and job delivery
- A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\)
- Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
- Two parallel machines scheduling with two-vehicle job delivery to minimize makespan
- Scenario analysis-based decision and coordination in supply chain management with production and transportation scheduling
- Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time
- Synchronizing production and air transportation scheduling using mathematical programming models
- Single machine scheduling with release dates and job delivery to minimize the makespan
- Two parallel machines problem with job delivery coordination and availability constraint
- Two faster algorithms for coordination of production and batch delivery: a note
- Machine scheduling with job class setup and delivery considerations
- An improved two-machine flowshop scheduling with intermediate transportation
- Coordinated scheduling of the outsourcing, in-house production and distribution operations
- Bin covering with a general profit function: approximability results
- Two-machine flow-shop scheduling with job delivery coordination
- Machine scheduling with a maintenance interval and job delivery coordination
- The Coordination of Two Parallel Machines Scheduling and Batch Deliveries
- Heuristics for parallel machine scheduling with batch delivery consideration
- Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination
- Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\)
- Single machine scheduling with batch delivery to multiple customers in a star-shaped network
- Machine scheduling with a maintenance interval and job delivery coordination
- Parallel machine scheduling with job delivery coordination
- Machine scheduling with pickup and delivery
- scientific article; zbMATH DE number 5027159 (Why is no real title available?)
- Using genetic algorithms for the coordinated scheduling problem of a batching machine and two-stage transportation
- Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time
- The bin covering with delivery problem, extended investigations for the online case
- Flow shop scheduling problems with transportation constraints revisited
- An improved approximation algorithm for a scheduling problem with transporter coordination
- An improved approximation algorithm for single machine scheduling with job delivery
- Two-machine flowshop scheduling with intermediate transportation under job physical space consideration
- An adaptive large neighborhood search for unrelated parallel machine scheduling with setup times and delivery times
- The coordination of single-machine scheduling with availability constraints and delivery
This page was built for publication: On the machine scheduling problem with job delivery coordination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q884029)
