Scheduling of non-repetitive lean manufacturing systems under uncertainty using intelligent agent simulation [PDF]
World-class manufacturing paradigms emerge from specific types of manufacturing systems with which they remain associated until they are obsolete. Since its introduction the lean paradigm is almost exclusively implemented in repetitive manufacturing ...
Mousavi, A, Papadopoulou, T C
core +1 more source
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage ...
Raviteja Buddala, Siba Sankar Mahapatra
doaj +1 more source
Bottleneck adjacent matching heuristics for scheduling a re-entrant flow shop with dominant machine problem [PDF]
The re-entrant flow shop environment has become prominent in the manufacturing industries and has recently attracted researchers attention. Typical examples of re-entrant flow shops are the printed circuit board manufacturing and furniture painting
Sh Ahmad, Sh Salleh
core
Scheduling predictive maintenance in flow-shop.
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
Flexible flow shop scheduling with stochastic processing times: A decomposition-based approach [PDF]
Flexible flow shop scheduling problems are NP-hard and tend to become more complex when stochastic uncertainties are taken into consideration. Although some methods have been developed to address such problems, they remain inherently difficult to solve ...
Choi, SH, Wang, K
core +1 more source
Scheduling of re-entrant flow shops [PDF]
AbstractWe propose and develop a scheduling system for a very special type of flow shop. This flow shop processes a variety of jobs that are identical from a processing point of view. All jobs have the same routing over the facilities of the shop and require the same amount of processing time at each facility.
Stephen C. Graves +3 more
openaire +3 more sources
Flow shop scheduling with earliness, tardiness and intermediate inventory holding costs [PDF]
We consider the problem of scheduling customer orders in a flow shop with the objective of minimizing the sum of tardiness, earliness (finished goods inventory holding) and intermediate (work-in-process) inventory holding costs. We formulate this problem
Bulbul, Kerem +3 more
core +2 more sources
FLOW-SHOP CYCLIC SCHEDULING FOR CYCLIC DELIVERIES
Abstract This paper considers a flow shop organised factory which produces n items and which is faced to cyclic delivery schedules based on mean demands. This factory engage to deliver periodically products in varying quantities between a min and a max values.
Bahroun, Zied +2 more
openaire +2 more sources
Particle swarm optimization applied to job shop scheduling [PDF]
In this project we have to apply the particle swarm optimization algorithm to job shop scheduling problem. Job shop scheduling is a combinatorial optimization problem where we have to arrange the jobs which may or may not be processed in every machine in
Dwivedi , Piyush, Vishal , Vivek
core
Solving no-wait two-stage flexible flow shop scheduling problem with unrelated parallel machines and rework time by the adjusted discrete Multi Objective Invasive Weed Optimization and fuzzy dominance approach [PDF]
Purpose: Adjusted discrete Multi-Objective Invasive Weed Optimization (DMOIWO) algorithm, which uses fuzzy dominant approach for ordering, has been proposed to solve No-wait two-stage flexible flow shop scheduling problem.
Gerami, Ali +2 more
core +4 more sources

