This paper presents a simple Optimised Search Heuristic for the Job Shop Scheduling problem that combines a GRASP heuristic with a branch-and-bound algorithm. The proposed method is compared with similar approaches and leads to better results in terms of solution quality and computing times

Little research has been done on hierarchical production planning systems (HPPS) in the context of rolling schedules with service-level constraints. Here, we adapt the stabilized-cycle strategy, which has initially been created for the master planning level (Meistering and Stadtler in Prod Oper...

This article addresses multi-stage assembly flow shop for the first time. We propose several industrial applications of this system in which the opening stage has m parallel machines and the following stages (e.g. assembly, transportation, painting, packaging, etc.) complete and prepare products...

Purpose: A decomposition heuristics based on multi-bottleneck machines for large-scale job shop scheduling problems (JSP) is proposed. Design/methodology/approach: In the algorithm, a number of sub-problems are constructed by iteratively decomposing the large-scale JSP according to the process...

Heuristics based on dispatching rules are still widely used in practice as methods for effective scheduling systems. Despite the successful development of various novel dispatching rules for traditional job shop scheduling environments, nearly none of these has been applied to cellular...