Multiresource-Constrained Flexible Job Shop Scheduling With Fixture Pallets and Setup Stations Under Pallet Automation Systems

Key findings from this study

• The study found that the intersection of available time across multiple resources enables construction of feasible schedules in pallet automation systems with fixture pallets and setup stations.
• The researchers demonstrate that critical path and point mutation strategies effectively balance exploration and exploitation in multiresource-constrained flexible job shop scheduling.
• The authors report that simultaneous optimization of resource selection and operation sequencing reduces makespan compared to decoupled decision approaches in pallet automation environments.

Overview

Pallet automation systems (PASs) decouple machine loading and unloading from processing by introducing dedicated setup stations, creating capacity advantages over traditional flexible manufacturing systems. Existing scheduling research on PASs neglects the joint optimization of fixture pallets and setup stations alongside machine selection and operation sequencing. This work formulates a multiresource-constrained flexible job shop scheduling problem (MRFJS) under PASs to minimize makespan while managing the interdependencies among machines, fixture pallets, and setup stations.

Methods and approach

The authors developed a mixed-integer programming model for the MRFJSP under PASs. A four-layer encoding scheme represents scheduling decisions across multiple resource dimensions. A novel decoding method uses time period insertion based on intersection of available resources (TPI-IAR) to generate feasible schedules while constraining the search space. A search algorithm leveraging critical paths and point mutations (SACP) balances exploration and exploitation during optimization. Four case studies validate the approach's performance and feasibility.

Results

The study demonstrates that TPI-IAR decoding produces feasible schedules by synchronizing resource availability across machines, fixture pallets, and setup stations. SACP effectively explores the solution space while maintaining computational tractability. Case studies confirm that simultaneous optimization of resource selection and operation sequencing yields schedules superior to those obtained through sequential decision-making. The approach handles the coupling between fixture pallet allocation and setup station scheduling constraints.

Implications

Pallet automation systems present scheduling complexity beyond traditional flexible manufacturing due to the separation of loading, processing, and unloading. Previous research treating machines as the primary constraint fails to capture the bottlenecks created by limited setup stations and fixture pallets. Explicit modeling of these multiresource interdependencies enables identification of scheduling strategies that leverage the PAS architecture. The proposed method provides a computational framework for practitioners to exploit the capacity benefits that PASs offer when resources are properly coordinated.

Scope and limitations

This summary is based on the study abstract and available metadata. It does not include a full analysis of the complete paper, supplementary materials, or underlying datasets unless explicitly stated. Findings should be interpreted in the context of the original publication.