A new heuristic algorithm for the machine scheduling problem with job delivery coordination
From MaRDI portal
Publication:1029329
Recommendations
- On the machine scheduling problem with job delivery coordination
- Heuristics for parallel machine scheduling with delivery times
- An improved approximation algorithm for single machine scheduling with job delivery
- Heuristics for parallel machine scheduling with batch delivery consideration
- Machine scheduling with an availability constraint and job delivery coordination
- Machine scheduling with job delivery coordination
- A Novel Heuristic Approach for Job Shop Scheduling Problem
- An improved heuristic for one-machine scheduling with delays constraints
- A hybrid heuristic to solve the parallel machines job-shop scheduling problem
Cites work
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- scientific article; zbMATH DE number 563208 (Why is no real title available?)
- scientific article; zbMATH DE number 1182767 (Why is no real title available?)
- 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
- Complexity of flow shop scheduling problems with transportation constraints
- Fast Approximation Algorithms for Knapsack Problems
- Heuristics for parallel machine scheduling with delivery times
- Improved algorithms for two single machine scheduling problems
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Machine scheduling with deliveries to multiple customer locations
- Machine scheduling with job delivery coordination
- Machine scheduling with transportation considerations
- On the machine scheduling problem with job delivery coordination
- Scheduling with batching: A review
- Single machine scheduling with batch deliveries
Cited in
(17)- Flow shop scheduling problems with transportation constraints revisited
- A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\)
- Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time
- Reductions between scheduling problems with non-renewable resources and knapsack problems
- Parallel machine scheduling with the total weighted delivery time performance measure in distributed manufacturing
- An improved approximation algorithm for a scheduling problem with transporter coordination
- 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
- Heuristics for parallel machine scheduling with batch delivery consideration
- Approximation algorithms for two-machine open shop scheduling with batch and delivery coordination
- Two parallel machines problem with job delivery coordination and availability constraint
- Preemptive scheduling in a two-stage supply chain to minimize the makespan
- Parallel machine scheduling with job delivery coordination
- An improved two-machine flowshop scheduling with intermediate transportation
- Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling
- Single machine scheduling with batch delivery to multiple customers in a star-shaped network
- Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time
This page was built for publication: A new heuristic algorithm for 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 Q1029329)
