MODEL PENJADWALAN BACKWARD HYBRID FLOW SHOP 2 STAGE UNTUK MEMINIMASI MEAN FLOWTIME
The scheduling problem is a common challenge when it comes to executing tasks, making the resolution of this issue crucial for decision-making in production activities.
Asep Anwar +2 more
doaj +1 more source
The classical hybrid flow shop scheduling problem (HFSP) only treats machines as the only resource constraint, ignoring the dominant role of workers in production and manufacturing.
Kaifeng Geng, Chunming Ye, Li Liu
doaj +1 more source
Scheduling predictive maintenance in flow-shop. [PDF]
International audienceAvailability of production equipments is one major issue for manufacturers. Predictive maintenance is an answer to prevent equipment from risk of breakdowns while minimizing the maintenance costs. Nevertheless, conflicts could occur
Varnier, Christophe +1 more
core +3 more sources
Blocking flow shop scheduling problem has been extensively studied because of its widespread industrial applications. However, the existing research mostly aims at makespan or total flow time minimization and ignores the criterion for energy saving. This
Fucai Wang +3 more
doaj +1 more source
Multi-Objective Hybrid Metaheuristic Search Algorithm for Distributed Reentrant Permutation Flow Shop Scheduling Via Considering Preventive Maintenance under Uncertainty [PDF]
: Distributing the production activities among the supply chain facilities with regard to the considered criteria can have a significant impact on the productive management. In this paper, a comprehensive mathematical model for reentrant permutation flow
Ali akbar Hasani
doaj +1 more source
Scheduling stochastic two-machine flow shop problems to minimize expected makespan [PDF]
During the past few years, despite tremendous contribution on deterministic flow shop problem, there are only limited number of works dedicated on stochastic cases.
Mehdi Heydari +2 more
doaj +1 more source
Multiprocessor task scheduling in multistage hyrid flowshops: a genetic algorithm approach [PDF]
This paper considers multiprocessor task scheduling in a multistage hybrid flow-shop environment. The objective is to minimize the make-span, that is, the completion time of all the tasks in the last stage.
Davis L +6 more
core +1 more source
Scheduling is one of the many skills required for advancement in today’s modern industry. The flow-shop scheduling problem is a well-known combinatorial optimization challenge. Scheduling issues for flow shops are NP-hard and challenging.
Shakuntla Singla +4 more
doaj +1 more source
Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective [PDF]
In this paper we address the classical hybrid flow shop scheduling problem with makespan objective. As this problem is known to be NP-hard and a very common layout in real-life manufacturing scenarios, many studies have been proposed in the literature to
Fernández-Viagas Escudero, Víctor +2 more
core
A Simultaneous Worker Assignment and Scheduling Problem to Minimize Makespan in Flexible Flow Shop via Metaheuristic Approaches [PDF]
In many real scheduling situations, it is necessary to deal with the worker assignment and job scheduling together. However, in traditional scheduling problems, only the machine is assumed to be a constraint and there isn’t any constraint about workers ...
Ebrahim Asadi-Gangraj +2 more
doaj +1 more source

