Hybrid Flexible Flow Shop Scheduling (HFFS) Instances

These instances represent the Hybrid Flexible Flow Shop Scheduling Problem (HFFS) with multiple sequential stages, each potentially containing several parallel machines. Each order contains a set of jobs which must be processed through these stages, and machines may have different processing capabilities, introducing flexibility in job assignment. Each machine is associated with work-in-progress (WIP) inventories of limited capacity which are used to temporarily store completed jobs before moving to the corresponding machine of the next stage. Additionally, machine-dependent transportation times between the stages are considered. Finally, each different instance consists of 3 separate days. The objective set of this problem is to minimize the makespan, i.e., the total completion time of all jobs. The scheduling must account for machine availability, processing times, WIP inventory constraints, and transportation times to determine an efficient job sequence and assignment. Different datasets of diverse size have been created, based on the number of orders and the number of stages.本数据集涵盖多阶段串行混合柔性流水车间调度问题（Hybrid Flexible Flow Shop Scheduling Problem, HFFS）的各类实例。该问题中每个生产阶段可配置多台并行机器，每个订单包含一组需按序流经各阶段的工件；不同机器可具备差异化加工能力，为工件的机器分配提供调度柔性。每台机器均关联有限容量的在制品（work-in-progress, WIP）库存，用于暂存已完成当前阶段加工、等待流转至下一阶段对应机器的工件。此外，模型还需考虑阶段间与机器相关的转运耗时。每个独立实例均包含3个完整工作日。 本问题的优化目标为最小化总完工时间（makespan），即所有工件的最终完成时刻。调度方案需综合考量机器可用状态、加工时长、在制品库存约束与转运耗时，以确定高效的工件加工序列与分配方案。 研究团队基于订单数量与生产阶段数量，构建了多组不同规模的数据集，覆盖多样化的问题场景。