Results 51 to 60 of about 4,911,676 (214)

Near-Optimal Heuristics for Just-In-Time Jobs Maximization in Flow Shop Scheduling

Algorithms, 2018
The number of just-in-time jobs maximization in a permutation flow shop scheduling problem is considered. A mixed integer linear programming model to represent the problem as well as solution approaches based on enumeration and constructive heuristics ...
Helio Yochihiro Fuchigami, Ruhul Sarker, Socorro Rangel   +2 more
doaj   +1 more source

Innovative Optimization Algorithms for Large-Sized Industrial Scheduling Problems [PDF]

Brazilian Archives of Biology and Technology
The problem of minimizing total quadratic completion time in flow shops presents a significant challenge in industries such as chemical, metallurgical, and ceramic manufacturing.
Helio Yochihiro Fuchigami, Alex Paranahyba Abreu   +1 more
doaj   +1 more source

MODEL PENJADWALAN BACKWARD HYBRID FLOW SHOP 2 STAGE UNTUK MEMINIMASI MEAN FLOWTIME

Jurnal Lebesgue
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, Rendiyatna Ferdian, Didit Damur Rochman   +2 more
doaj   +1 more source

Workload Control in Flow Shops with Bottleneck Shifting and Process Time Variability

Production Engineering Archives
Manufacturing industries struggle to devise precise planning and scheduling solutions due to unpredictable business situations. Additionally, uncertainties in production such as machine breakdowns, labour absenteeism, cycle time deviations, etc., would ...
Prabhu Aruna, Raghunandana K, Pai P Yogesh   +2 more
doaj   +1 more source

Non-permutation flow shop scheduling problem with preemption-dependent processing time

Cogent Engineering, 2016
In this paper, the non-permutation flow shop scheduling problem with preemption-dependent processing times is considered. A mixed integer programming formulation is proposed to tackle the problem. The optimization objective considered is the minimization
Mohsen Ziaee, Hossein Karimi
doaj   +1 more source

Multi-Objective Parallel Variable Neighborhood Search for Energy Consumption Scheduling in Blocking Flow Shops

IEEE Access, 2018
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, Guanlong Deng, Tianhua Jiang, Shuning Zhang   +3 more
doaj   +1 more source

REVIEW ON JOB-SHOP AND FLOW-SHOP SCHEDULING USING

Journal of Mechanical Engineering, 2011
Scheduling is widely studied and complex combinatorial optimization problems. A vast amount of research has been performed in this particular area to effectively schedule jobs for various objectives. The multi-criteria scheduling problem is one of the main research subjects in the field of modern manufacturing where most of them are considered as NP ...
Hafiz Ullah, Sultana Parveen
openaire   +2 more sources

A Reinforcement Learning Approach to Robust Scheduling of Permutation Flow Shop. [PDF]

Biomimetics (Basel), 2023
Zhou T, Luo L, Ji S, He Y.
europepmc   +1 more source

Evolutionary Multiobjective Blocking Lot-Streaming Flow Shop Scheduling With Machine Breakdowns

IEEE Transactions on Cybernetics, 2019
In various flow shop scheduling problems, it is very common that a machine suffers from breakdowns. Under this situation, a robust and stable suboptimal scheduling solution is of more practical interest than a global optimal solution that is sensitive to
Yu-yan Han, D. Gong, Yaochu Jin, Q. Pan
semanticscholar   +1 more source

Lean Production: A Way To Reduce The Internal Inventory And Cycle Time

Jurnal Teknik Industri, 2008
The progressive competition among industries and the increase of customer expectation will lead the progressive efforts in reducing the cost of production and logistic activities in the future.
Ilyas Mas'udin
doaj   +1 more source