.png){kind=icon}
Return
An effective heuristic algorithm for the partial shop scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2018.01.015.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In a partial shop scheduling problem the operations of each job have to respect a partial order, which can be different for each job. We study the problem of finding a solution of minimal makespan in partial shops. This problem generalizes many problems which have been studied independently in the literature, such as the group shop scheduling problem, the mixed shop scheduling problem, and the open shop scheduling problem. In this paper we propose an algorithm which is able to find solutions for the partial shop scheduling problem. In computational experiments we find that the proposed single heuristic can compete with the state-of-the-art heuristics for the partial shop, group shop, mixed shop, and open shop, and in many cases, improves the state of the art. The main contribution of this paper is the demonstration that a single algorithm can solve effectively many special cases of the partial shop without taking into consideration their particular structure. We highlight the contribution of the main novel components of the algorithm, namely the initial solution generator, neighbourhood structure, and the lower bound for new solutions generated by such neighbourhood. (C) 2018 Elsevier Ltd. All rights reserved.
Keywords:
Partial shop scheduling
Mixed shop scheduling
Group shop scheduling
Open shop scheduling
Heuristic
Iterated tabu search
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
Cited Papers
.png){kind=icon}
ShareSaveRegio-selective acylation of biologically important iridoid glycosides by Candida antarctica lipase
PREAI
ShareSaveShareSave
View more