Parallel machine scheduling with batch delivery to two customers
Summary: In some make-to-order supply chains, the manufacturer needs to process and deliver products for customers at different locations. To coordinate production and distribution operations at the detailed scheduling level, we study a parallel machine scheduling model with batch delivery to two customers by vehicle routing method. In this model, the supply chain consists of a processing facility with \(m\) parallel machines and two customers. A set of jobs containing \(n_1\) jobs from customer 1 and \(n_2\) jobs from customer 2 are first processed in the processing facility and then delivered to the customers directly without intermediate inventory. The problem is to find a joint schedule of production and distribution such that the tradeoff between maximum arrival time of the jobs and total distribution cost is minimized. The distribution cost of a delivery shipment consists of a fixed charge and a variable cost proportional to the total distance of the route taken by the shipment. We provide polynomial time heuristics with worst-case performance analysis for the problem. If \(m = 2\) and \((n_1 - b)(n_2 - b) < 0\), we propose a heuristic with worst-case ratio bound of 3/2, where \(b\) is the capacity of the delivery shipment. Otherwise, the worst-case ratio bound of the heuristic we propose is \(2 - 2 /(m + 1)\).
- Supply chain scheduling with parallel machines
- Parallel machine scheduling with batch deliveries to minimize total flow time and delivery cost
- Heuristics for parallel machine scheduling with batch delivery consideration
- Two parallel machines scheduling with two-vehicle job delivery to minimize makespan
- Integrated Job Scheduling with Parallel-Batch Processing and Batch Deliveries
- Heuristics for parallel machine scheduling with delivery times
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Integrated machine scheduling and vehicle routing with time windows
- Integrated Scheduling of Production and Distribution Operations
- Machine scheduling with job delivery coordination
- Scheduling. Theory, algorithms, and systems.
- Two parallel machines scheduling with two-vehicle job delivery to minimize makespan
- Scheduling identical parallel machines with a fixed number of delivery dates
- Scheduling on parallel machines to minimise maximum lateness for the customer order problem
- Supply chain scheduling with parallel machines
- Mixed binary integer programming formulation for the two-echelon supply chain system with two customer locations
- A review on integrated scheduling and outbound vehicle routing problems
- Scheduling parallel machines for the customer order problem
This page was built for publication: Parallel machine scheduling with batch delivery to two customers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1665075)
