Results 11 to 20 of about 84,491 (259)
Efficient heuristics for the parallel blocking flow shop scheduling problem [PDF]
Expert Systems With Applications, 2017 We consider the NP-hard problem of scheduling n jobs in F identical parallel flow shops, each consisting of a series of m machines, and doing so with a blocking constraint.
Imma Ribas +2 more
exaly +4 more sources
The hybrid flow shop scheduling problem [PDF]
European Journal of Operational Research, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ruben Ruiz
exaly +3 more sources
Scheduling a proportionate flow shop of batching machines [PDF]
Journal of Scheduling, 2020 AbstractIn this paper we study a proportionate flow shop of batching machines with release dates and a fixed number $$m \ge 2$$ m ≥ 2 of machines.
Christoph Hertrich +4 more
openaire +3 more sources
On Two-machine Flow Shop Scheduling [PDF]
Journal of the Operations Research Society of China, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chen, Lin +2 more
openaire +2 more sources
UET flow shop scheduling with delays [PDF]
RAIRO - Theoretical Informatics and Applications, 1996 Summary: F\(|\)UET, delays \(|C_{\max}\) is introduced and shown to be NP-complete.
Victor J. Rayward-Smith, Djamal Rebaine
openaire +1 more source
Approximation algorithms for the parallel flow shop problem [PDF]
, 2012 We consider the NP-hard problem of scheduling n jobs in m two-stage parallel flow shops so as to minimize the makespan. This problem decomposes into two subproblems: assigning the jobs to parallel flow shops; and scheduling the jobs assigned to the same ...
Velde, S.L. (Steef) van de +1 more
core +2 more sources
A Note on Heuristics of Flow-Shop Scheduling [PDF]
Operations Research, 1996 We present an O(mn) two-group (TG) heuristic for the m-machine, n-job permutation flow-shop scheduling problem. We show that heuristic TG has a worst-case performance ratio of (m + 1)/2. We also establish worst-case bounds for several heuristics proposed in the past.
openaire +2 more sources
An approximation algorithm for the three-machine scheduling problem with the routes given by the same partial order [PDF]
, 2014 The paper considers a three-machine shop scheduling problem to minimize the makespan, in which the route of a job should be feasible with respect to a machine precedence digraph with three nodes and one arc.
Quibell, Richard, Strusevich, Vitaly A.
core +1 more source
Flow shop scheduling with earliness, tardiness and intermediate inventory holding costs [PDF]
, 2003 We consider the problem of scheduling customer orders in a flow shop with the objective of minimizing the sum of tardiness, earliness (finished goods inventory holding) and intermediate (work-in-process) inventory holding costs. We formulate this problem
Bulbul, Kerem +3 more
core +2 more sources
A Novel Metaheuristics To Solve Mixed Shop Scheduling Problems
, 2013 This paper represents the metaheuristics proposed for solving a class of Shop Scheduling problem. The Bacterial Foraging Optimization algorithm is featured with Ant Colony Optimization algorithm and proposed as a natural inspired computing approach to ...
Ravibabu, V.
core +1 more source