scholarly journals Heuristics for parallel machine scheduling with batch delivery consideration

2014 ◽  
Vol 10 (1) ◽  
pp. 259-273 ◽  
Author(s):  
Leiyang Wang ◽  
◽  
Zhaohui Liu
Keyword(s):  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Batch Delivery

scholarly journals Parallel Machine Scheduling with Batch Delivery to Two Customers

2015 ◽  
Vol 2015 ◽  
pp. 1-6 ◽  
Author(s):  
Xueling Zhong ◽  
Dakui Jiang
Keyword(s):  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Variable Cost ◽  
Worst Case ◽  
Batch Delivery ◽  
Worst Case Ratio ◽  
Processing Facility ◽  
Production And Distribution ◽  
Distribution Cost

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 withmparallel machines and two customers. A set of jobs containingn1jobs from customer 1 andn2jobs 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. Ifm=2and(n1-b)(n2-b)<0, we propose a heuristic with worst-case ratio bound of 3/2, wherebis the capacity of the delivery shipment. Otherwise, the worst-case ratio bound of the heuristic we propose is2-2/(m+1).

Parallel machine scheduling with job delivery coordination

2017 ◽  
Vol 58 ◽  
pp. 306
Author(s):  
Jianming Dong ◽  
Xueshi Wang ◽  
Liliang Wang ◽  
Jueliang Hu
Keyword(s):  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Job Delivery

No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines

2021 ◽  
Vol 132 ◽  
pp. 105315
Author(s):  
Nadia Brauner ◽  
Mikhail Y. Kovalyov ◽  
Alain Quilliot ◽  
Hélène Toussaint
Keyword(s):  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Release Dates
Sign in / Sign up

Export Citation Format

Share Document