Results 51 to 60 of about 87,422 (257)

Bottleneck-based heuristic for three-machine flow shop scheduling [PDF]

, 2011
This paper considers a 3 machine flow shop (M1M2M3) with tendency of dominant (bottleneck) machine at M1. The developed bottleneck based heuristics from previous studies are considered in this case by Hezzeril (2010) and Irwan (2010), but were only ...
Abdul Rahim, Mohd Salleh
core  

Comparative simulation study of production scheduling in the hybrid and the parallel flow [PDF]

, 2017
Scheduling is one of the most important decisions in production control. An approach is proposed for supporting users to solve scheduling problems, by choosing the combination of physical manufacturing system configuration and the material handling ...
Al, Aneke, Arrais, Cao, Cao, Carvalho, Cheng, Diering, Haouari, Henning, Huang, Huang, Jain, Jain, Janiak, Johnson, Kujawinska, Kujawińska, Lenstra, Linn, Madureira, Madureira, Madureira, Magalhães, McPherson, Mehta, Muhlemann, Naderi, Nowicki, Ovacik, Ovacik, Pinto, Quadt, Ribeiro, Ruiz, Ruiz, Sabuncuoglu, Sun, Szelke, Vairaktarakis, Varela, Varela, Varela, Vieira, Vieira, Vieira, Vieira, Yamamoto, Zhang   +48 more
core   +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

Research on Multi-Objective Hybrid Flow Shop Scheduling Problem With Dual Resource Constraints Using Improved Memetic Algorithm

IEEE Access, 2020
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

Multi-Objective Hybrid Metaheuristic Search Algorithm for Distributed Reentrant Permutation Flow Shop Scheduling Via Considering Preventive Maintenance under Uncertainty [PDF]

مدیریت تولید و عملیات, 2018
: 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

Evolving control rules for a dual-constrained job scheduling scenario [PDF]

, 2016
Dispatching rules are often used for scheduling in semiconductor manufacturing due to the complexity and stochasticity of the problem. In the past, simulation-based Genetic Programming has been shown to be a powerful tool to automate the time-consuming ...
Branke, Jürgen, Groves, Matthew J., Hildebrandt, Torsten   +2 more
core   +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

Scheduling stochastic two-machine flow shop problems to minimize expected makespan [PDF]

Decision Science Letters, 2013
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, Mohammad Mahdavi Mazdeh, Mohammad Bayat   +2 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

Realization of an Optimal Schedule for the Two-machine Flow-Shop with Interval Job Processing Times [PDF]

, 2007
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