An iterated local search for customer order scheduling in additive manufacturing
نویسندگان
چکیده
This paper studies the customer order scheduling problem in context of additive manufacturing. The study discusses an integrated involving nesting parts as well batches nested onto unrelated parallel machines. A mixed-integer programming model is presented, based on existing formulations from literature, that integrates different materials and sequence-dependent setup times. Additionally, a metaheuristic iterated local search proposed for configuration under consideration. Focusing minimizing total weighted tardiness orders, efficiency heuristic approach evaluated using comprehensive test data. Further, we show importance considered order-related objective by qualitative analysis.
منابع مشابه
Controller Placement in Software Defined Network using Iterated Local Search
Software defined network is a new computer network architecture who separates controller and data layer in network devices such as switches and routers. By the emerge of software defined networks, a class of location problems, called controller placement problem, has attracted much more research attention. The task in the problem is to simultaneously find optimal number and location of controll...
متن کاملIterated local search for the multiple depot vehicle scheduling problem
The multiple depot vehicle scheduling problem (MDVSP) is a well-known and important problem arising in public transport. Although many solution approaches have been published in the literature, algorithms using metaheuristics appeared only very recently (Large Neighborhood Search and Tabu Search). In this paper, we introduce an Iterated Local Search algorithm for the MDVSP, incorporating a neig...
متن کاملIterated greedy local search methods for unrelated parallel machine scheduling
This work deals with the parallel machines scheduling problem which consists in the assignment of n jobs on m parallel machines. The most general variant of this problem is when the processing time depends on the machine to which each job is assigned to. This case is known as the unrelated parallel machines problem. Similarly to most of the literature, this paper deals with the minimization of ...
متن کاملIterated Local Search for the Generator Maintenance Scheduling Problem
We consider the task of devising an effective metaheuristic for a variant of the preventive maintenance scheduling problem (PMSP) — the (power) generator maintenance scheduling problem (GMSP). Recent research on metaheuristics for this problem has made progress on it, but the potential economic benefits of effective methods is significant in this area, and warrants further focused work. We prop...
متن کاملIterated Local Search
Iterated Local Search has many of the desirable features of a metaheuristic: it is simple, easy to implement, robust, and highly effective. The essential idea of Iterated Local Search lies in focusing the search not on the full space of solutions but on a smaller subspace defined by the solutions that are locally optimal for a given optimization engine. The success of Iterated Local Search lies...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Production Research
سال: 2023
ISSN: ['1366-588X', '0020-7543']
DOI: https://doi.org/10.1080/00207543.2023.2167015