A Variable Iterated Local Search Algorithm for Energy-Efficient No-idle Flowshop Scheduling Problem
نویسندگان
چکیده
منابع مشابه
No-wait flexible flowshop scheduling with no-idle machines
This paper considers a two-stage flexible flowshop scheduling problem with no waiting time between two sequential operations of a job and no idle time between two consecutive processed jobs on machines of the second stage. We show its complexity and present a heuristic algorithm with asymptotically tight error bounds. © 2004 Elsevier B.V. All rights reserved.
متن کاملIterated Local Search Algorithm for the Constrained Two-Dimensional Non-Guillotine Cutting Problem
An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...
متن کاملA General Variable Neighborhood Search Algorithm to Minimize Makespan of the Distributed Permutation Flowshop Scheduling Problem
This paper addresses minimizing the makespan of the distributed permutation flow shop scheduling problem. In this problem, there are several parallel identical factories or flowshops each with series of similar machines. Each job should be allocated to one of the factories and all of the operations of the jobs should be performed in the allocated factory. This problem has recently gained attent...
متن کامل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 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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Manufacturing
سال: 2019
ISSN: 2351-9789
DOI: 10.1016/j.promfg.2020.01.351