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...

We consider the scheduling problem of minimizing the average weighted completion time on identical parallel machines when jobs are arriving over time. For both the preemptive and the nonpreemptive setting, we show that straightforward extensions of Smith's ratio rule yield smaller competitive...