The Moth-Flame Optimization Algorithm for Flow Shop Scheduling Problem with Travel Time
This article examined the flow shop scheduling problem by considering the travel time between machines. The objective function of this problem was to provide a makespan.
Ikhlasul Amallynda, Bhisma Hutama
doaj +1 more source
Purpose: This research develops a batch scheduling model for a three-stage flow shop with job processors in the first and second stages and a batch processor in the third stage.
Pratya Poeri Suryadhini+3 more
doaj +1 more source
We propose a batch-scheduling model to minimize the total actual flow time (TAF) of parts to be processed in a flow shop consisting of m batch-processing machines.
Abdul Hakim Halim+2 more
doaj +1 more source
Scheduling predictive maintenance in flow-shop [PDF]
Availability 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 between maintenance and production if a maintenance operation is programmed when equipment is used for production.
Varnier, Christophe+1 more
openaire +4 more sources
Hybrid Flow Shop Scheduling Problems Using Improved Fireworks Algorithm for Permutation
Prior studies are lacking which address permutation flow shop scheduling problems and hybrid flow shop scheduling problems together to help firms find the optimized scheduling strategy.
Xuelian Pang+4 more
doaj +1 more source
Dynamic MPC-Based Scheduling in a Smart Manufacturing System Problem
This paper introduces a dynamic scheduling algorithm designed to minimize makespan within a smart manufacturing system, accommodating delays in the production process.
Alessandro Bozzi+3 more
doaj +1 more source
A precedence constrained flow shop scheduling problem with transportation time, breakdown times, and weighted jobs [PDF]
Job precedence can often be seen in various manufacturing process scenarios. For instance, in the context of flow shop scheduling, certain jobs must be processed before a specific job may be executed.
M. Thangaraj+2 more
doaj +1 more source
Constraint programing for solving four complex flexible shop scheduling problems
In recent years, with the advent of robust solvers such as Cplex and Gurobi, constraint programing (CP) has been widely applied to a variety of scheduling problems.
Leilei Meng+7 more
doaj +1 more source
Multi-criteria scheduling of realistic flexible job shop: a novel approach for integrating simulation modelling and multi-criteria decision making [PDF]
Increased flexibility in job shops leads to more complexity in decision-making for shop floor engineers. Partial Flexible Job Shop Scheduling (PFJSS) is a subset of Job shop problems and has substantial application in the real world. Priority Dispatching Rules (PDRs) are simple and easy to implement for making quick decisions in real-time.
arxiv +1 more source
Distributed shop scheduling: A comprehensive review on classifications, models and algorithms
In the intelligent manufacturing environment, modern industry is developing at a faster pace, and there is an urgent need for reasonable production scheduling to ensure an organized production order and a dependable production guarantee for enterprises ...
Jianguo Duan+3 more
doaj +1 more source