Skoči na glavni sadržaj

Izvorni znanstveni članak

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


Puni tekst: hrvatski pdf 839 Kb

str. 297-302

preuzimanja: 558

citiraj

Puni tekst: engleski pdf 839 Kb

str. 297-302

preuzimanja: 756

citiraj


Sažetak

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.

Ključne riječi

dynamic programming; outsourcing; scheduling; serial batching

Hrčak ID:

138080

URI

https://hrcak.srce.hr/138080

Datum izdavanja:

22.4.2015.

Podaci na drugim jezicima: hrvatski

Posjeta: 2.786 *