Results 161 to 170 of about 4,911,676 (214)
Some of the next articles are maybe not open access.

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   +3 more
openaire   +3 more sources

Stochastic multi-objective modelling and optimization of an energy-conscious distributed permutation flow shop scheduling problem with the total tardiness constraint

Journal of Cleaner Production, 2019
Recent years have seen a great deal of attention in energy conservation for production and manufacturing activities, particularly for energy-intensive industries.
Yaping Fu   +4 more
semanticscholar   +1 more source

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

Digital twin-driven dynamic scheduling of a hybrid flow shop

Journal of Intelligent Manufacturing, 2022
Khalil Tliba   +5 more
semanticscholar   +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

Home - About - Disclaimer - Privacy