A Heuristic-Based Adaptive Iterated Greedy Algorithm for Lot-Streaming Hybrid Flow Shop Scheduling Problem with Consistent and Intermingled Sub-Lots. [PDF]
Lu Y, Tang Q, Pan Q, Zhao L, Zhu Y.
europepmc +1 more source
Flow shop scheduling problem is to schedule a production process of n jobs that go through the same process sequence and the same m machines. Most researches are don to accomplish only one objective, i.e. minimizing makespan. The other objective, such as
Tessa Vanina Soetanto +2 more
doaj
Moderating effects of cross-cultural dimensions on the relationship between persuasive smartphone application's design and acceptance-loyalty [PDF]
Applying persuasive system design to different cultures has been a focus of many researchers as the global medium of communication has been centered within Smartphone via applications (apps).
Faisal, Serri
core
Dataset of metaheuristics for the flow shop scheduling problem with maintenance activities integrated. [PDF]
Branda A +3 more
europepmc +1 more source
In this paper, we propose a formulation of the permutation flow and job shop scheduling problems using special recursive functions and show its equivalence to the existing classical formulation.
Boris Kupriyanov +3 more
doaj +1 more source
Hierarchical Control of Production Flow based on Capacity Allocation for Real-Time Scheduling of Manufacturing System [PDF]
8International audienceThis paper considers the modelling and simulation of a hierarchical production-flow control system. It uses a continuous control approach for machine capacity allocation at the design level and real time scheduling at the shop ...
Boukezzoula, Reda +2 more
core +1 more source
Energy-efficient distributed heterogeneous re-entrant hybrid flow shop scheduling problem with sequence dependent setup times considering factory eligibility constraints. [PDF]
Geng K, Liu L, Wu Z.
europepmc +1 more source
An Improved Simulated Annealing-Based Decision Model for the Hybrid Flow Shop Scheduling of Aviation Ordnance Handling. [PDF]
Meng X, Wang N, Liu J, Liu Q.
europepmc +1 more source
Realization of an Optimal Schedule for the Two-machine Flow-Shop with Interval Job Processing Times [PDF]
Non-preemptive two-machine flow-shop scheduling problem with uncertain processing times of n jobs is studied. In an uncertain version of a scheduling problem, there may not exist a unique schedule that remains optimal for all possible realizations of the
Leshchenko, Natalja, Sotskov, Yuri
core
Hybrid Flow Shop Scheduling (HFS) has garnered significant interest in terms of problem formulation and solution approaches. This work introduces an optimization approach for a case study on a hybrid flow shop scheduling problem.
Siti Nur Hazwani Husna Mohd Hata +2 more
doaj +1 more source

