Two parallel machines scheduling with two-vehicle job delivery to minimize makespan
Summary: A problem of parallel machine scheduling with coordinated job deliveries is handled to minimize the makespan. Different jobs call for dissimilar sizes of storing space in the process of transportation. A range of jobs of one customer in the problem have priority to be processed on two identical parallel machines without preemption and then delivered to the customer by two vehicles in batches. For this NP-hard problem, we first prove that it is impossible to have a polynomial heuristic with a worst-case performance ratio bound less than 2 unless P = NP. Thereafter, we develop a polynomial heuristic for this problem, the worst-case ratio of which is bounded by 2.
- Two parallel machines scheduling with one availability constraint and jobs with delivery times
- Two parallel machines problem with job delivery coordination and availability constraint
- Two parallel machines scheduling with periodic maintenance to minimize makespan
- Capacitated two-parallel machines scheduling to minimize sum of job completion times
- The Coordination of Two Parallel Machines Scheduling and Batch Deliveries
- Scheduling Two-Point Stochastic Jobs to Minimize the Makespan on Two Parallel Machines
- Parallel machine scheduling with batch delivery to two customers
- Makespan minimization for two parallel machines scheduling with a periodic availability constraint
- Minimizing makespan for two parallel machines with job limit on each availability interval
- A new heuristic algorithm for the machine scheduling problem with job delivery coordination
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 563208 (Why is no real title available?)
- Improved algorithms for two single machine scheduling problems
- Integrated machine scheduling and vehicle routing with time windows
- Integrated Production and Outbound Distribution Scheduling: Review and Extensions
- Integrated Scheduling of Production and Distribution Operations
- Machine scheduling with an availability constraint and job delivery coordination
- Machine scheduling with job delivery coordination
- On the machine scheduling problem with job delivery coordination
- On-line integrated production-distribution scheduling problems with capacitated deliveries
- Scheduling with job delivery coordination on single machine
- The coordination of scheduling and batch deliveries
- Tight absolute bound for first fit decreasing bin-packing: \(\operatorname{FFD}(L)\leq 11/9 \operatorname{OPT}(L)+6/9\)
- Two parallel machines problem with job delivery coordination and availability constraint
- Unbounded parallel batch scheduling with job delivery to minimize makespan
- Heuristics for parallel machine scheduling with delivery times
- Parallel machine scheduling with batch delivery to two customers
- Machine scheduling with job delivery coordination
- A tight approximation algorithm for problem \(P2\rightarrow D|v=1,c=1|C_{\max }\)
- Two parallel machines problem with job delivery coordination and availability constraint
- The Coordination of Two Parallel Machines Scheduling and Batch Deliveries
- SINGLE MACHINE SCHEDULING WITH JOB DELIVERY TO MINIMIZE MAKESPAN
- Heuristics for parallel machine scheduling with batch delivery consideration
- Parallel machine scheduling with job delivery coordination
This page was built for publication: Two parallel machines scheduling with two-vehicle job delivery to minimize makespan
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2296256)
