Results 221 to 230 of about 15,254 (266)
Some of the next articles are maybe not open access.
Inequalities for stochastic flow shops and job shops
Applied Stochastic Models and Data Analysis, 1986AbstractConsider an m‐machine flow shop with n jobs. The processing time of job j, j = 1,…, n, on each one of the m machines is equal to the random variable Xj and is distributed according to Fj. We show that, under certain conditions, more homogeneous distributions F1,…, Fn result in a smaller expected makespan.
Pinedo, Michael, Wie, Sung-Hwan
openaire +2 more sources
FLOW SHOP SCHEDULING WITH REINFORCEMENT LEARNING
Asia-Pacific Journal of Operational Research, 2013Reinforcement learning (RL) is a state or action value based machine learning method which solves large-scale multi-stage decision problems such as Markov Decision Process (MDP) and Semi-Markov Decision Process (SMDP) problems. We minimize the makespan of flow shop scheduling problems with an RL algorithm. We convert flow shop scheduling problems into
ZHICONG ZHANG +3 more
openaire +3 more sources
A Note on Permutation Flow Shop Problem
Annals of Operations Research, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
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
Proportionate flow-shop scheduling with rejection
Journal of the Operational Research Society, 2016In many heavily loaded manufacturing systems, managers routinely make use of outsourcing options in order to maintain reasonable Quality of Service for customers. Thus, there is a strong need to provide tools for managers to economically coordinate sourcing and scheduling decisions.
Dvir Shabtay, Daniel Oron
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
Lot sizing in a no-wait flow shop
Operations Research Letters, 1995zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hamilton Emmons, Kamlesh Mathur
openaire +2 more sources
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