Hierarchical approach to production scheduling in make-to-order assembly

Abstract

This paper presents a hierarchical framework and integer programming formulations for multi-objective production scheduling in a make-to-order manufacturing environment. Integer programming formulations are proposed for the long-term assignment of customer orders to planning periods and the short-term machine assignment and scheduling of production lots in a hybrid flow shop with multi-capacity machines and due-date-related performance measures. The integer programs have been enhanced by the addition of cutting constraints derived for both the long-term customer order assignment and the short-term machine scheduling. Numerical examples modelled on a real-world make-to-order assembly system in the electronics industry are provided and computational results are reported.

Simulation for Improving the Performance of Small and Medium Sized Enterprises

“…The operative production planning becomes a complex process closely associated with variations in the parameters of the preparation and production. This primarily refers to the changing needs of customers, the inability to influence the parameters of the production process (machine failure, justified and unjustified absences of employees), uncertainty of the procurement process, deficiencies in the documentation and the like [2,7]. For these very reasons, manufacturing enterprises often use ERP (Enterprise Resource Planning) system to schedule and manage resources uniformly in order to enhance competitive advantage, efficiency and performance of business process.…”

A method for the hierarchical planning of the structure, dimension and material requirements of manufacturing systems

“…The majority of existing approaches to hierarchical planning of manufacturing systems focus on the short-term time horizon and address lot sizing or scheduling problems, see for instance Ebadian et al (2009), Toledo et al (2009), Sawik (2006, Dumoulin and Vercellis (2000). However, integrated approaches incorporating both short-term and long-term time horizons which enable partial (re-) planning of tactical and operational decisions and which integrate with existing business information systems, remain scarce.…”

A relaxation heuristic for scheduling flowshops with intermediate buffers

“…Thus, at the level II there are more possibilities of distribution of tasks, and they are assigned to the machines of the stage selected at the level I. The examples of the tasks of balancing machine workload may be found in: [3,9,20].…”

“…Another constraint (20) ensures integrity of the tasks in time and space: each task for the given product is executed in one machine on the continuous basis, that is it cannot be interrupted. It is assigned to the consecutive time intervals whose number is equal to t vk : the time of loading the stage v by the product k. The task is assigned to one of the machines assigned to the stage v. If the tasks are executed for the product k assigned to the machine i ((i, v) ∈ D) and it begins in the time interval f , and ends in the time interval l, then q ikl = q ikf = 1, and also q ikr = 1 for r ∈ L, where: f < r < l. Then, the relationship is maintained: lq ikl − f q ikf ≤ t vk -1, presented in the constraint (20).…”

“…Execution of many assembly tasks requires setting up a corresponding part feeder near the assembly station. A separate group of variables was taken into account in the developed algorithm, used for distribution of feeders, just like in [6] and [20]. With this, the algorithm is also used for supporting assembly systems designing.…”