Efficient methods for scheduling make-to-order assemblies under resource, assembly area and part availability constraints

Abstract

Standard-Nutzungsbedingungen:Die Dokumente auf EconStor dürfen zu eigenen wissenschaftlichen Zwecken und zum Privatgebrauch gespeichert und kopiert werden.Sie dürfen die Dokumente nicht für öffentliche oder kommerzielle Zwecke vervielfältigen, öffentlich ausstellen, öffentlich zugänglich machen, vertreiben oder anderweitig nutzen.Sofern die Verfasser die Dokumente unter Open-Content-Lizenzen (insbesondere CC-Lizenzen) zur Verfügung gestellt haben sollten, gelten abweichend von diesen Nutzungsbedingungen die in der dort genannten Lizenz gewährten Nutzungsrechte.

Integrated scheduling, assembly area- and part-assignment for large-scale, make-to-order assemblies

“…Further efForts are headed towards more sophisticated metaheuristic methods to solve the assembly scheduling problem (cf. Kolisch and Heß [19]). …”

Effective genetic approach for optimizing advanced planning and scheduling in flexible manufacturing system

“…Equation (6) restricts the available capacity for each machine. Equation (7) ensures that the precedence constraints are not violated.…”

“…Tan (2000) reported a briefly review of the research in the process planning and scheduling area and discussed the extent of applicability of various approaches [4], and also proposed a linearized polynomial mixed integer programming model for this problem [5]. Kolisch and Hess (2000) considered the problem of scheduling multiple, large-scale, make-to-order assemblies under resource, assembly area, and part availability constraints. They introduced three efficient heuristic solution methods, a biased random sampling method and two Tabu Search-based large-step optimization methods [6].…”

“…Kolisch and Hess (2000) considered the problem of scheduling multiple, large-scale, make-to-order assemblies under resource, assembly area, and part availability constraints. They introduced three efficient heuristic solution methods, a biased random sampling method and two Tabu Search-based large-step optimization methods [6]. Dellaert et al (2000) discussed multilevel lot-sizing problem in material requirements planning (MRP) systems [7].…”

A CMPSO Algorithm Based Approach to Solve the Multi-plant Supply Chain Problem

“…Swarnkar and Tiwari (2004) applied a hybrid Tabu Simulated Annealing based approach to model the machine loading in flexible manufacturing system (FMS). Similarly Tabu and constructive heuristic-based approaches have been proposed by Kolisch, and Hess (2000), Tan and Khoshnevis (2004), and Kolisch (2000). Hybrid approaches combining evolutionary computation with other tools have also gained increasing attention.…”