Results 301 to 310 of about 85,049 (338)
Some of the next articles are maybe not open access.
On scheduling in map-reduce and flow-shops
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures, 2011The map-reduce paradigm is now standard in industry and academia for processing large-scale data. In this work, we formalize job scheduling in map-reduce as a novel generalization of the two-stage classical flexible flow shop (FFS) problem: instead of a single task at each stage, a job now consists of a set of tasks per stage.
Anirban Dasgupta +3 more
openaire +2 more sources
Scheduling Multiprocessor Flow Shops
1994We 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 +2 more sources
Flow-shop scheduling by heuristic decomposition
International Journal of Production Research, 1973SUMMARY This paper investigates the classical n-job, M-machine flow-shop scheduling problem under the assumption that jobs are processed on all machines in the same order. Baaed on the heuristic job-pairing technique and the decomposition strategy, a heuristic decomposition algorithm is developed which will generate at least a near-optimal schedule for
Jatinder N. D. Gupta, A. R. Maykut
openaire +2 more sources
Online scheduling of ordered flow shops
European Journal of Operational Research, 2019Abstract We consider online as well as offline scheduling of ordered flow shops with the makespan as objective. In an online flow shop scheduling problem, jobs are revealed to a decisionmaker one by one going down a list. When a job is revealed to the decision maker, its operations have to be scheduled irrevocably without having any information ...
Lee, Kangbok +2 more
openaire +3 more sources
Hybrid flow shop scheduling: A survey
Computers & Industrial Engineering, 1999Extensive work has been done in hybrid flow shop scheduling. This paper reviews the state of art and discusses in details their contributions. The review is concluded with suggestions for future research directions.
Linn, R., Zhang, W.
openaire +3 more sources
Production and scheduling system in the flow shop
Omega, 1988On a developpe une methode basee sur le groupement des articles produits pour faciliter l'ordonnancement de la production. Dans l'usine utilisee pour l'etude, le rapport d'utilisation de la chaine de fabrication a ete accrue de 7% par cette ...
Hitoshi Tsubone, Takao Tanaka
openaire +2 more sources
Flow-shop scheduling in the metal industry
Proceedings of the 1998 IEEE International Conference on Control Applications (Cat. No.98CH36104), 2002In the metal industry, the processing of a part requires first the heating of the ingot, and when the ingot has reached the desired temperature, it is then launched in the shop and processed by the machines. In a flow-shop environment, a part cools down and its processing time on each machine is increased, to a point where it may be necessary to stop ...
C. Sriskandarajah, E. Wagneur
openaire +2 more sources
Review on Hybrid Flow Shop Scheduling
2011 International Conference of Information Technology, Computer Engineering and Management Sciences, 2011As a vital decision-making progress, hybrid flow shops (HFS) are common manufacturing environments in which a set of n jobs are to be processed in a series of m stages optimizing a given objective function. Focusing on its complex nature, this paper presents a literature review on HFS scheduling problem, classifies the various type of the problem ...
openaire +2 more sources
A Hybrid Flow Shop Scheduling Problem
2019Hybrid flow shop environment generally refers to the flow shop with multiple parallel machines per stage. Hybrid flow shop scheduling problem (HFSP) is a complex combinatorial optimization problem that came across in many real-life problems. In this study, a real-life HFSP of a lubricant company is considered, where the aim is to minimize total ...
Ayşegül Eda Özen +6 more
openaire +2 more sources
Flow shop scheduling with two machines
2005A flow shop problem has n jobs (i = 1. , n) on m machines (j = 1, . . . , m) and a job consists two operations and the jth operation of each job must be processed on machine j. Any job can start only on machine j if it is completed on machine j-1 and if machine j is free. Each operation has a known processing time pij. The work here focuses on the case
openaire +3 more sources