Results 261 to 270 of about 196,547 (296)

A scheduling algorithm for flexible flow shop problem

Proceedings of the 4th World Congress on Intelligent Control and Automation (Cat. No.02EX527), 2003
This paper considers the flexible flow shops scheduling problem. The objective is to minimize the makespan. This is an NP-hard problem. A scheduling algorithm is presented. In this algorithm, the longest-processing-time-first heuristic is used for machine allocation. A genetic algorithm is used for solving the problem of finding a good loading sequence.
null Li Wang, null Dawei Li
openaire   +1 more source

Pheromone based emergent shop floor control system for flexible flow shops

Artificial Intelligence in Engineering, 2001
New approaches for the development of shop floor control systems are needed to introduce better response to unanticipated disturbance situations and a better handling of ‘reconfiguration’ in production environments. In this paper, a development approach for agent-based shop floor control systems is presented, that uses co-ordination concepts as ...
Peeters, Patrick, Van Brussel, Hendrik, Valckenaers, Paul, Wyns, Jo, Bongaerts, Luc, Heikkilä, Tapio, Kollingbaum, Martin   +6 more
openaire   +2 more sources

Flexible Flow Shop Scheduling by Intelligent Multi-agents

2010 Eighth ACIS International Conference on Software Engineering Research, Management and Applications, 2010
This paper presents some important improvements to a previously proposed intelligent production system dealing with a dynamic flexible flow shop scheduling problem under a multi-stage multi-machine factory environment. These improvements greatly help upgrade the overall system performance under stable demand situations as well as under fluctuated ...
Wei Weng, Shigeru Fujimura
openaire   +1 more source

Flow Shops and Flexible Flow Shops (Deterministic)

2008
In many manufacturing and assembly facilities each job has to undergo a series of operations. Often, these operations have to be done on all jobs in the same order implying that the jobs have to follow the same route. The machines are then assumed to be set up in series and the environment is referred to as a flow shop.
openaire   +1 more source

Scheduling flexible flow shops with no setup effects

IEEE Transactions on Robotics and Automation, 1994
This paper presents an efficient, optimization model-based approach for scheduling the production of discrete-part, make-to-order type of flexible flow shops, where setup effects are negligible. A nominal scheduling algorithm based on Lagrangian relaxation and minimum cost linear network flow is first developed for scheduling under nominal conditions ...
Chang, Shi-Chung, Liao, Da-Yin
openaire   +2 more sources

A palmer-based continuous fuzzy flexible flow-shop scheduling algorithm

Soft Computing, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hong, T.-P., Wang, T.-T., Wang, S.-L.
openaire   +1 more source

Flexible flow shop scheduling with interval grey processing time

Grey Systems: Theory and Application, 2020
Purposepurpose of this paper is providing a solution for flexible flow shop scheduling problem with uncertain processing time in aeronautical composite lay-up workshop.Design/methodology/approachA flexible flow scheduling model and algorithm with interval grey processing time is established.
Yuquan Wang, Naiming Xie
openaire   +1 more source

Performance Comparison of Some Classes of Flexible Flow Shops and Job Shops

International Journal of Flexible Manufacturing Systems, 1998
Flexible manufacturing systems (FMSs) for two-stage production may possess a variety of operating flexibilities in the form of tooling capabilities for the machines and alternative routings for each operation. In this paper, we compare the throughput performance of several flexible flow shop and job shop designs.
Lee, Chung Yee, Vairaktarakis, George L.
openaire   +2 more sources

Improved imperialist competitive algorithm for flexible flow shop scheduling

2017 9th International Conference on Modelling, Identification and Control (ICMIC), 2017
In this paper, we investigate the flexible flow-shop scheduling problem (FFSP). The mathematical model is established to minimize the makespan. Improved Imperialist Competitive Algorithm (IICA) is proposed as the global searching mechanism for this optimization problem.
Sun Yue, Lin Shuo, Li Tan, Ma Xiaofu
openaire   +1 more source

A novel swarm optimiser for flexible flow shop scheduling

International Journal of Swarm Intelligence, 2013
In this work, a particle swarm optimisation (PSO) algorithm with chaotic mutation operator is proposed to solve flexible flow shop scheduling problems. Mutation, a commonly used operator in genetic algorithm, has been introduced so that common problem of trapping of solutions at local minima in PSO can be avoided.
Manas Ranjan Singh, S.S. Mahapatra, Kaushik Mishra   +2 more
openaire   +1 more source