Results 221 to 230 of about 15,254 (266)
Some of the next articles are maybe not open access.
A Comparative Study of Flow-Shop Algorithms
Operations Research, 1975This paper describes an experimental comparison of flow-shop algorithms, motivated by the need to consolidate recent research on this topic. Using a set of test problems, it investigated various branch-and-bound and elimination strategies in a comparative study and then combined them to produce a new and efficient solution algorithm.
openaire +1 more source
2012
In this chapter, job processing requirements are considered to be uncertain. They are no longer assumed to be deterministically known. One modeling approach would be to consider processing time probability distributions, and indeed this is done in a later chapter.
Hamilton Emmons, George Vairaktarakis
openaire +1 more source
In this chapter, job processing requirements are considered to be uncertain. They are no longer assumed to be deterministically known. One modeling approach would be to consider processing time probability distributions, and indeed this is done in a later chapter.
Hamilton Emmons, George Vairaktarakis
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
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
2012
In this chapter we organize the literature on the hybrid flow shop scheduling problem that has appeared since the late 1950’s. We see a number of interesting and diverse industrial applications of this system, and find that the majority of research focuses on the makespan objective.
Hamilton Emmons, George Vairaktarakis
openaire +1 more source
In this chapter we organize the literature on the hybrid flow shop scheduling problem that has appeared since the late 1950’s. We see a number of interesting and diverse industrial applications of this system, and find that the majority of research focuses on the makespan objective.
Hamilton Emmons, George Vairaktarakis
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
Flow-shop scheduling with a learning effect
Journal of the Operational Research Society, 2005The paper is devoted to some flow-shop scheduling problems with a learning effect. The objective is to minimize one of the two regular performance criteria, namely, makespan and total flowtime. A heuristic algorithm with worst-case bound m for each criteria is given, where m is the number of machines. Furthermore, a polynomial algorithm is proposed for
Ji-Bo Wang, Z.-Q. Xia
openaire +1 more source
2012
After describing some real-world examples of flow shops with no waiting, we demonstrate the equivalence of no-wait and blocking in the shop with m = 2. For the no-wait shop, some research is available on the flow time objective while the majority of research focuses on the makespan objective.
Hamilton Emmons, George Vairaktarakis
openaire +1 more source
After describing some real-world examples of flow shops with no waiting, we demonstrate the equivalence of no-wait and blocking in the shop with m = 2. For the no-wait shop, some research is available on the flow time objective while the majority of research focuses on the makespan objective.
Hamilton Emmons, George Vairaktarakis
openaire +1 more source
Hybrid flow-shop with adjustment
Kybernetika, 2011Summary: The subject of this paper is a flow-shop based on a case study aimed at the optimisation of ordering production jobs in mechanical engineering, in order to minimize the overall processing time, the makespan. The production jobs are processed by machines, and each job is assigned to a certain machine for technological reasons. Before processing
openaire +2 more sources
A Randomized Algorithm for Flow Shop Scheduling
1999Shop scheduling problems are known to be notoriously intractable, both in theory and practice. In this paper we give a randomized approximation algorithm for flow shop scheduling where the number of machines is part of the input problem. Our algorithm has a multiplicative factor of 2(1 + δ) and an additive term of O(mln(m+ n)pmax)/δ2).
Naveen Garg 0001 +2 more
openaire +1 more source