Results 161 to 170 of about 468,839 (205)

Flow Shop Scheduling with Resource Flexibility

Operations Research, 1994
This paper explores the improvements in manufacturing efficiency that can be achieved by broadening the scope of production scheduling to include both the sequencing of work and the coordination of the resource inputs required to perform work. Recognizing that some resources are inherently flexible and thus can be reassigned dynamically to processing ...
Daniels, Richard L., Mazzola, Joseph B.
openaire   +1 more source

Clustered flow shop models

Journal of Global Optimization, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

The Hybrid Flow Shop

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

FLOW SHOP SCHEDULING WITH REINFORCEMENT LEARNING

Asia-Pacific Journal of Operational Research, 2013
Reinforcement 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, WEIPING WANG, SHOUYAN ZHONG, KAISHUN HU   +3 more
openaire   +3 more sources

Interactive flow-shop scheduling

2020
147
openaire   +2 more sources

Flow shop vs. permutation shop with time delays

Computers & Industrial Engineering, 2005
This paper considers the evaluation of the worst-case performance ratio between the best solution of the flow shop problem and the permutation flow shop with time delays considerations. It is observed that, even in the restricted case of two machines and unit execution time operations, the two models may generate different optimal values for the ...
openaire   +1 more source

General flow-shop and job-shop problems

1976
In this chapter we consider general flow-shop and job-shop problems for which the number m of machines is variable. All these problems can be proved to be NP-complete from results in previous chapters; consequently the algorithms discussed in this chapter are mainly of the branch-and-bound type.
openaire   +1 more source

Scheduling Multiprocessor Flow Shops

1994
We address the well-known problem of scheduling multiprocessor flow shops. For a given k-stage processing facility, where at each stage one or more identical machines are available, and a given collection of independent jobs, each comprising k tasks to be processed in order, one per stage, find a schedule that minimizes the makespan.
openaire   +1 more source

Computational Intelligence in Flow Shop and Job Shop Scheduling

2009
For over fifty years now, the famous problem of flow shop and job shop scheduling has been receiving the attention of researchers in operations research, engineering, and computer science. Over the past several years, there has been a spurt of interest in computational intelligence heuristics and metaheuristics for solving this problem. This book seeks
Yağmahan, Betül, Yenisey, Mehmet Mutlu
openaire   +3 more sources

Flow Shop Problems with Time Lags

Management Science, 1983
This paper defines a model that covers the multimachine extensions of all existing flow-shop problems with time lags as well as flow-shop problems where setup, processing and release times are separated. Approximate solutions and lower completion time bounds are developed for the restricted and unrestricted cases.
openaire   +2 more sources