Article ID: | iaor20097140 |
Country: | United Kingdom |
Volume: | 3 |
Issue: | 1 |
Start Page Number: | 15 |
End Page Number: | 27 |
Publication Date: | Mar 2008 |
Journal: | International Journal of Services Operations and Informatics |
Authors: | Niemi Esko, Toivonen Ville |
Keywords: | scheduling |
Levelling the workload of resources in the planning of make‐to‐order production can be realised through scheduling manufacturing activities within the timing constraints of each order. Such levelled schedules may be generated by Aggregate Production Planning (APP). This paper presents and examines the transformation of aggregate production plans into detailed shop‐floor schedules. The conditions and methods for creating feasible schedules are analysed in the cases of continuously divisible resources, single machines and parallel machines. Illustrative solutions and experimental results are provided.