Skip to the main content

Original scientific paper

https://doi.org/10.17559/TV-20150312154507

The single machine serial batch production scheduling with outsourcing allowed

Juan Zou ; (1) School of Management, Qufu Normal University, Rizhao, Shandong, 276826, China; (2) School of Mathematical Sciences, Qufu Normal University, Qufu, Shandong, 273165, China
Yuzhong Zhang ; School of Management, Qufu Normal University, Rizhao, Shandong, 276826, China
Cuixia Miao ; School of Mathematical Sciences, Qufu Normal University, Qufu, Shandong, 273165, China


Full text: croatian pdf 839 Kb

page 297-302

downloads: 558

cite

Full text: english pdf 839 Kb

page 297-302

downloads: 756

cite


Abstract

We consider several serial batch scheduling problems with outsourcing allowed. Each job can be either processed on the in-house machine or outsourced. The objective is to minimize the weighted sum of the scheduling cost and the total outsourcing cost. We discuss three classical scheduling objective functions. The first is the total completion time, the second is the maximum lateness, and the third is the weighted number of late jobs. For each problem, we derive an efficient dynamic programming algorithm that minimizes the total cost.

Keywords

dynamic programming; outsourcing; scheduling; serial batching

Hrčak ID:

138080

URI

https://hrcak.srce.hr/138080

Publication date:

22.4.2015.

Article data in other languages: croatian

Visits: 2.786 *