Solving Non-Permutation Flow Shop Scheduling Problem with Time Couplings

Solving Non-Permutation Flow Shop Scheduling Problem with Time Couplings

In this paper, a non-permutation variant of the Flow Shop Scheduling Problem with Time Couplings and makespan minimization is considered. Time couplings are defined as machine minimum and maximum idle time allowed. The problem is inspired by the concreting process encountered in industry. The mathem...

Full description

Bibliographic Details
Main Authors: Radosław Idzikowski, Jarosław Rudy, Andrzej Gnatowski
Format: Article
Language:English
Published: MDPI AG 2021-05-01
Series:Applied Sciences
Subjects:
flow shop
scheduling
time couplings
limited-idle
elimination properties
metaheuristics
Online Access:https://www.mdpi.com/2076-3417/11/10/4425

Similar Items

Similar Items