Scheduling with resource allocation and past-sequence-dependent setup times including maintenance

Zhanguo Zhu (1, 2) , Feng Chu (1) , Linyan Sun (2, 3) , Mingjie Liu (4)

1 IBISC - Informatique, Biologie Intégrative et Systèmes Complexes
2 School of Management
3 State Key Laboratory for Mechanical Manufacturing Systems Engineering
4 School of Economics and Management

In this work, scheduling problems with resource allocation and past-sequence-dependent (p-s-d) setup times are considered. Under these settings, the actual job processing times are dependent on the amount of resource allocated and the setup times are proportionate to the length of the already processed jobs. The objective function is a combination of the total completion time and the total resource consumption. In addition, the machine may need maintenance to improve its production efficiency, so the maintenance is also integrated. The optimal job sequence, the optimal amount of resource allocated to each job, and the optimal maintenance position are determined jointly. It is shown that the problem under study is polynomial time solvable.

Mots clés: ob processing time; Job sequences; Objective functions; Optimal maintenance; Polynomial-time; Production efficiency; Resource consumption; Scheduling problem; Set-up time; Total completion time

Domaines: Recherche opérationnelle [math.OC]

Zhanguo Zhu, Feng Chu, Linyan Sun, Mingjie Liu. Scheduling with resource allocation and past-sequence-dependent setup times including maintenance. International Conference on Networking, Sensing and Control (ICNSC 2011), Apr 2011, Delft, Netherlands. pp.383--387, ⟨10.1109/ICNSC.2011.5874920⟩. ⟨hal-00869206⟩