Results 141 to 150 of about 4,911,676 (214)
Some of the next articles are maybe not open access.
2019
Consider scheduling tasks on dedicated processors or machines. We assume that tasks belong to a set of n jobs, each of which is characterized by the same machine sequence.
Jacek Blazewicz +5 more
openaire +1 more source
Consider scheduling tasks on dedicated processors or machines. We assume that tasks belong to a set of n jobs, each of which is characterized by the same machine sequence.
Jacek Blazewicz +5 more
openaire +1 more source
IEEE transactions on fuzzy systems, 2020
Flow shop scheduling (FSS) problem constitutes a major part of production planning in every manufacturing organization. It aims at determining the optimal sequence of processing jobs on available machines within a given customer order. In this article, a
Erfan Babaee Tirkolaee +2 more
semanticscholar +1 more source
Flow shop scheduling (FSS) problem constitutes a major part of production planning in every manufacturing organization. It aims at determining the optimal sequence of processing jobs on available machines within a given customer order. In this article, a
Erfan Babaee Tirkolaee +2 more
semanticscholar +1 more source
2012
We introduce flow shops that revisit certain processors, and define the common patterns of flow: cyclic, chain, hub, and V-shaped. We show that even the simplest case, the (1,2,1)-reentrant shop, is NPhard, establish properties that facilitate a branch-and-bound algorithm, and present two simple but very effective heuristics.
Hamilton Emmons, George Vairaktarakis
openaire +1 more source
We introduce flow shops that revisit certain processors, and define the common patterns of flow: cyclic, chain, hub, and V-shaped. We show that even the simplest case, the (1,2,1)-reentrant shop, is NPhard, establish properties that facilitate a branch-and-bound algorithm, and present two simple but very effective heuristics.
Hamilton Emmons, George Vairaktarakis
openaire +1 more source
IEEE Transactions on Cybernetics, 2020
Green scheduling in the manufacturing industry has attracted increasing attention in academic research and industrial applications with a focus on energy saving.
Fuqing Zhao, Xuan He, Ling Wang
semanticscholar +1 more source
Green scheduling in the manufacturing industry has attracted increasing attention in academic research and industrial applications with a focus on energy saving.
Fuqing Zhao, Xuan He, Ling Wang
semanticscholar +1 more source
Flow Shops and Flexible Flow Shops (Deterministic)
2008In 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
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
IEEE Transactions on Systems, Man, and Cybernetics: Systems, 2020
Hybrid flow shop scheduling problems have gained an increasing attention in recent years because of its wide applications in real-world production systems.
Yaping Fu +3 more
semanticscholar +1 more source
Hybrid flow shop scheduling problems have gained an increasing attention in recent years because of its wide applications in real-world production systems.
Yaping Fu +3 more
semanticscholar +1 more source
Flow Shops, Job Shops and Open Shops (Stochastic)
2008The results for stochastic flow shops, job shops, and open shops are somewhat less extensive than those for their deterministic counterparts.
openaire +1 more source
2012
When job parameters are uncertain or unpredictable, new types of policies become possible. Besides static policies, we now should consider dynamic policies, with or without preemption. Objectives too have more variety. The makespan, for example, is now random; we usually choose to minimize its expectation.
Hamilton Emmons, George Vairaktarakis
openaire +1 more source
When job parameters are uncertain or unpredictable, new types of policies become possible. Besides static policies, we now should consider dynamic policies, with or without preemption. Objectives too have more variety. The makespan, for example, is now random; we usually choose to minimize its expectation.
Hamilton Emmons, George Vairaktarakis
openaire +1 more source
A cooperative coevolution algorithm for multi-objective fuzzy distributed hybrid flow shop
Knowledge-Based Systems, 2020With consideration of uncertainty in the distributed manufacturing systems, this paper addresses a multi-objective fuzzy distributed hybrid flow shop scheduling problem with fuzzy processing times and fuzzy due dates.
Jie Zheng, Ling Wang, Jing-jing Wang
semanticscholar +1 more source