Results 261 to 270 of about 4,171,244 (302)
Some of the next articles are maybe not open access.
Flow Shop Scheduling with Partial Resource Flexibility
Management Science, 2004Resource flexibility refers to the ability to dynamically reallocate units of resource from one stage of a production process to another in response to shifting bottlenecks. Recent research has demonstrated that substantial improvements in operational performance can be realized in both serial- and parallel-machine production environments through the ...
Richard L. Daniels +2 more
openaire +1 more source
Scheduling flexible flow shops with no setup effects
IEEE Transactions on Robotics and Automation, 1994This 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 ...
Shi-Chung Chang, Da-Yin Liao
openaire +4 more sources
2012
We introduce four types of flexibility encountered in a flow shop: job routing through a hybrid shop, machine assignment, allocation of a scarce resource over the tasks to speed up processing, and the composition of daily production batches to satisfy requirements for a finite set of parts over a finite horizon.
Hamilton Emmons, George Vairaktarakis
openaire +1 more source
We introduce four types of flexibility encountered in a flow shop: job routing through a hybrid shop, machine assignment, allocation of a scarce resource over the tasks to speed up processing, and the composition of daily production batches to satisfy requirements for a finite set of parts over a finite horizon.
Hamilton Emmons, George Vairaktarakis
openaire +1 more source
Scheduling optimization of flexible flow shop
2018 IEEE 4th Information Technology and Mechatronics Engineering Conference (ITOEC), 2018According to the production characteristics of flexible job shop scheduling in practice, the initial solution is generated by random Numbers, Gantt chart is drawn, and the maximum process time is calculated. Then, a simplified algorithm is proposed with reference to Johnson's algorithm.
Xuefeng Liu, Zhenhui Shen, Lingmin Dai
openaire +1 more source
Group scheduling in flexible flow shops
International Journal of Production Economics, 2005Abstract Flexible flow shops are becoming increasingly common in industry practice due to higher workloads imposed by jobs. As a result, one or more stages in a flexible flow shop will have two or more units of the same machine type. The group scheduling problem, comprised of two levels of scheduling, is investigated in this paper to minimize the ...
Rasaratnam Logendran +2 more
openaire +1 more source
Flexible Flow Shop Scheduling by Intelligent Multi-agents
2010 Eighth ACIS International Conference on Software Engineering Research, Management and Applications, 2010This 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 0001, Shigeru Fujimura 0001
openaire +1 more source
A water-flow algorithm for flexible flow shop scheduling with intermediate buffers
Journal of Scheduling, 2010We investigate the flexible flow shop scheduling problem with limited or unlimited intermediate buffers. A common objective of the problem is to find a production schedule that minimizes the completion time of jobs. Other objectives that we also consider are minimizing the total weighted flow time of jobs and minimizing the total weighted tardiness ...
Trung Hieu Tran, Kien Ming Ng
openaire +1 more source
Pheromone based emergent shop floor control system for flexible flow shops
Artificial Intelligence in Engineering, 2001New 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 ...
Patrick Peeters +6 more
openaire +2 more sources
A scheduling algorithm for flexible flow shop problem
Proceedings of the 4th World Congress on Intelligent Control and Automation (Cat. No.02EX527), 2003This 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
Buffer allocation optimization for flexible flow shop
2016 IEEE Information Technology, Networking, Electronic and Automation Control Conference, 2016To order single type multistage flexible flow shop problems setting up the buffer capacity optimization, considering the coupling relationship between all levels of process node premise, based on the continuous time Markov stochastic process theory established the multi-level queuing network node status model of flow shop.
Li Xiang, Yu Ai-ling, Zhang Hui-yu
openaire +1 more source