Results 41 to 50 of about 84,439 (205)

FLOW-SHOP CYCLIC SCHEDULING FOR CYCLIC DELIVERIES

open access: yesIFAC Proceedings Volumes, 2006
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

UET flow shop scheduling with delays [PDF]

open access: yesRAIRO - Theoretical Informatics and Applications, 1996
Summary: F\(|\)UET, delays \(|C_{\max}\) is introduced and shown to be NP-complete.
Rayward-Smith, V. J., Rebaine, D.
openaire   +1 more source

Particle swarm optimization applied to job shop scheduling [PDF]

open access: yes, 2007
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  

Mixed integer linear programming models for Flow Shop Scheduling with a demand plan of job types [PDF]

open access: yes, 2018
This is a post-peer-review, pre-copyedit version of an article published in Central european journal of operations research. The final authenticated version is available online at: http://www.doi.org/10.1007/s10100-018-0553-8This paper presents two mixed
Alfaro Pozo, Rocío   +1 more
core   +2 more sources

Improved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems

open access: yesJournal of Industrial Engineering International, 2017
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

Robust multi-objective hybrid flow shop scheduling

open access: yesJournal of Applied Research on Industrial Engineering, 2021
Scheduling is an important decision-making process that aims to allocate limited resources to the jobs in a production process. Among scheduling problems, Hybrid Flow Shop (HFS) scheduling has good adaptability with most real world applications including
Behnaz Zanjani   +3 more
doaj   +1 more source

On non-permutation solutions to some two machine flow shop scheduling problems [PDF]

open access: yes, 1994
In this paper, we study two versions of the two machine flow shop scheduling problem, where schedule length is to be minimized. First, we consider the two machine flow shop with setup, processing, and removal times separated.
Strusevich, V. (Vitaly)   +1 more
core   +2 more sources

Scheduling of non-repetitive lean manufacturing systems under uncertainty using intelligent agent simulation [PDF]

open access: yes, 2008
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

Multiple bottlenecks sorting criterion at initial sequence in solving permutation flow shop scheduling problem [PDF]

open access: yes, 2021
This paper proposes a heuristic that introduces the application of bottleneck-based concept at the beginning of an initial sequence determination with the objective of makespan minimization.
A. S., Zainudin   +3 more
core  

Bottleneck adjacent matching heuristics for scheduling a re-entrant flow shop with dominant machine problem [PDF]

open access: yes, 2009
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  

Home - About - Disclaimer - Privacy