A matheuristic for flexible job shop scheduling problem with lot-streaming and machine reconfigurations
Multi-variety and small-batch production mode enables manufacturing industries to
expeditiously satisfy customers' personalised demands, where a large amount of identical …
expeditiously satisfy customers' personalised demands, where a large amount of identical …
A two-stage RNN-based deep reinforcement learning approach for solving the parallel machine scheduling problem with due dates and family setups
As an essential scheduling problem with several practical applications, the parallel machine
scheduling problem (PMSP) with family setups constraints is difficult to solve and proven to …
scheduling problem (PMSP) with family setups constraints is difficult to solve and proven to …
The on-demand warehousing problem
Warehouses are key elements of supply chain networks, and great attention is paid to
increase their efficiency. Highly volatile space requirements are enablers of innovative …
increase their efficiency. Highly volatile space requirements are enablers of innovative …
Scheduling identical parallel batch processing machines involving incompatible families with different job sizes and capacity constraints
C Li, F Wang, JND Gupta, T Chung - Computers & Industrial Engineering, 2022 - Elsevier
This paper investigates the problem of scheduling jobs on parallel batch processing
machines with incompatible job families, non-identical job sizes, arbitrary job release times …
machines with incompatible job families, non-identical job sizes, arbitrary job release times …
A transformer-based deep reinforcement learning approach for dynamic parallel machine scheduling problem with family setups
The parallel machine scheduling problem (PMSP) involves the optimized assignment of a
set of jobs to a collection of parallel machines, which is a proper formulation for the modern …
set of jobs to a collection of parallel machines, which is a proper formulation for the modern …
Iterated greedy algorithms for a complex parallel machine scheduling problem
This paper addresses a complex parallel machine scheduling problem with jobs divided into
operations and operations grouped in families. Non-anticipatory family setup times are held …
operations and operations grouped in families. Non-anticipatory family setup times are held …
Solving the two-machine open shop problem with a single server with respect to the makespan
We address in this paper the two-machine open shop problem with a single server to
prepare jobs before going through the processing so as to minimize the makespan. The …
prepare jobs before going through the processing so as to minimize the makespan. The …
Simheuristic algorithm for a stochastic parallel machine scheduling problem with periodic re-planning assessment
This paper addresses a parallel machine scheduling problem with non-anticipatory family
setup times and batching, considering the task's stochastic processing times and release …
setup times and batching, considering the task's stochastic processing times and release …
A metaheuristic-based efficient strategy for multi-unit production planning with unique process constraints
R Kommadath, D Maharana, P Kotecha - Applied Soft Computing, 2023 - Elsevier
Production planning provides optimal strategic planning to attain economic benefits in the
petrochemical industries and helps to maintain competitiveness in the global market. This …
petrochemical industries and helps to maintain competitiveness in the global market. This …
An adaptive large neighborhood search algorithm for parallel assembly lines scheduling problem with complex fixture constraints
Z Mao, Y Xu, K Fang, C Wang, D Huang - Computers & Industrial …, 2024 - Elsevier
In recent years, the value chain facilitates the transition of competition among enterprises
from a single link to a comprehensive one, thereby driving intelligent upgrades within …
from a single link to a comprehensive one, thereby driving intelligent upgrades within …