Integrated production and delivery scheduling on a serial batch machine to minimize the makespan

Lu, Lingfa; Zhang, Liqi; Wan, Long

doi:10.1016/j.tcs.2015.01.014

Cited by 8 publications

(2 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It was assumed that the delivery cost depends on time period for delivery, but not dependent on individual jobs. Lu et al [31] integrated production and delivery scheduling on a serial batch machine to minimize the makespan. Two-machine ow shop scheduling with transportation constraints was suggested by Yuan et al [32] to minimize makespan.…”

Section: Literature Reviewmentioning

confidence: 99%

A Joint Scheduling of Production and Distribution Operations in a Flow Shop Manufacturing System

2017

View full text Add to dashboard Cite

Abstract. In traditional scheduling problems and many real-world applications, the production operations are scheduled regardless of distribution decisions. Indeed, the completion time of a job in such problems is de ned traditionally as the time when the production sequences of a job are nished. However, in many practical environments, completed orders are delivered to customers immediately after production stages without any further inventory storage. Therefore, in this paper, we investigate an integrated scheduling model of production and distribution problems simultaneously. It is assumed that products proceed through a permutation ow shop scheduling manufacturing system and are delivered to customers via available vehicles. The objective of our integrated model is to minimize the Maximum Returning Time (MRT), which is the time it takes for the last vehicle to deliver the last order to a relevant customer and return to production center. The problem is formulated mathematically, and then an Improved Imperialist Competitive Algorithm (I-ICA) is proposed for solving it. Furthermore, a su cient number of test problems are generated for computational study. Various parameters of the algorithm are analyzed to calibrate the algorithm by means of the Taguchi method. At the end, the e ectiveness of the proposed model and suggested algorithm is evaluated through a computational study where the obtained results show the appropriate performance of the integrated model and solving approach in comparison to those of the other algorithms.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

A Joint Scheduling of Production and Distribution Operations in a Flow Shop Manufacturing System

2017

View full text Add to dashboard Cite

show abstract

“…ey analysed some useful properties and presented a heuristic for the general case and two optimal algorithms for two special cases. Lu et al [12] studied the integrated production and delivery scheduling on a serial-batch machine to minimize the makespan and considered four different problems from the situations whether split is allowed in the production or delivery of the jobs.…”

Section: Introductionmentioning

confidence: 99%

Integrated Scheduling Problem on a Single Bounded Batch Machine with an Unavailability Constraint

Fan

2020

Discrete Dynamics in Nature and Society

View full text Add to dashboard Cite

We consider a scheduling problem where a set of jobs are first processed on a machine with an unavailability interval and, then, delivered to the customer directly. We focus on an integrated schedule of production and distribution such that the sum of the maximum delivery time and total delivery cost is optimized. We study two classes of processing machines in the production part. In the first class, the serial-batch machine, the processing time of a batch is the sum of the processing times of its jobs. In the second class, the parallel-batch machine, the processing time of a batch is the maximum processing time of the jobs contained in the batch. The machine has a fixed capacity, and the jobs are processed in batches under the condition that the total size of the jobs in a batch cannot exceed the machine capacity. Two patterns of job’s processing, i.e., resumable and non-resumable, are considered if it is interrupted by the unavailability interval on the machine. In the distribution part, there are sufficient vehicles with a fixed capacity to deliver the completed jobs. The total size of the completed jobs in one delivery cannot exceed the vehicle capacity. We show that these four problems are NP-hard in the strong sense in which the jobs have the same processing times and arbitrary sizes, and we propose an approximation algorithm for solving these four problems. Moreover, we show that the performance ratio of the algorithm is 2 for the serial-batch machine setting, and the error bound is 71/99 for the parallel-batch machine setting. We also evaluate the performance of the approximation algorithm by the computational results.

show abstract

Online integrated production–distribution scheduling problems without preemption

et al. 2015

View full text Add to dashboard Cite

Integrated production and delivery scheduling on a serial batch machine to minimize the makespan

Cited by 8 publications

References 22 publications

A Joint Scheduling of Production and Distribution Operations in a Flow Shop Manufacturing System

A Joint Scheduling of Production and Distribution Operations in a Flow Shop Manufacturing System

Integrated Scheduling Problem on a Single Bounded Batch Machine with an Unavailability Constraint

Online integrated production–distribution scheduling problems without preemption

Contact Info

Product

Resources

About