- Journal
- INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL
- Année
- 2010
- Volume
- 6
- Numéro
- 8
- Pages
- 3657-3668
- Mois
- AUG
Abstract
This article considers a particular batch scheduling problem with batch-size-dependent setup times. The objective of this problem is the determination of a production and transportation plan for a single-product case to meet the demand of the customer at minimum total costs. The costs may include production, transportation and holding costs. The problem is, in fact, the sum of two sub problems: a lot sizing problem and a scheduling problem. We show that the main problem is NP hard. Despite the complexity of the problem, we highlight a dominance property on the set of solutions that is the base of a very efficient dynamic programming scheme. Computational results illustrate the efficiency of the proposed algorithm in comparison with other similar approaches.