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 Algorithms for a Hybrid Flow Shop under Uncertainty [PDF]
Algorithms, 2020 In modern production systems, scheduling problems have to be solved in consideration of frequently changing demands and varying production parameters. This paper presents a approach combining forecasting and classification techniques to predict uncertainty from demands, and production data with heuristics, metaheuristics, and discrete event simulation ...
Christin Schumacher, Peter Buchholz 0001
openaire +2 more sources
Scheduling hybrid flow shops with time windows [PDF]
Journal of Heuristics, 2019 Hybrid flow shops can be encountered in various industrial settings. In this paper we develop methods for scheduling hybrid flow shops with hard time windows. Specifically, we study a two-stage hybrid flow shop scheduling problem with time windows to minimize the total weighted completion times.
Fan Yang 0119, Roel Leus
openaire +2 more sources
A genetic algorithm for robust hybrid flow shop scheduling [PDF]
International Journal of Computer Integrated Manufacturing, 2011 Most of scheduling methods consider a deterministic environment for which the data of the problem are known. Nevertheless, in reality, several kinds of uncertainties should be considered, and robust scheduling allows uncertainty to be taken into account. In this article, we consider a scheduling problem under uncertainty.
Tarek Chaari +3 more
openaire +1 more source
A novel hybrid genetic algorithm to solve the make-to-order sequence-dependent flow-shop scheduling problem [PDF]
, 2014 Flow-shop scheduling problem (FSP) deals with the scheduling of a set of n jobs that visit a set of m machines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding,
Ghomi, S.M.T. Fatemi +2 more
core +1 more source
Multiprocessor task scheduling in multistage hyrid flowshops: a genetic algorithm approach [PDF]
, 2004 This paper considers multiprocessor task scheduling in a multistage hybrid flow-shop environment. The objective is to minimize the make-span, that is, the completion time of all the tasks in the last stage.
Davis L +6 more
core +1 more source
Climbing depth-bounded adjacent discrepancy search for solving hybrid flow shop scheduling problems with multiprocessor tasks [PDF]
, 2011 This paper considers multiprocessor task scheduling in a multistage hybrid flow-shop environment. The problem even in its simplest form is NP-hard in the strong sense.
A. Ben Hmida +13 more
core +2 more sources
Comparative simulation study of production scheduling in the hybrid and the parallel flow [PDF]
, 2017 Scheduling is one of the most important decisions in production control. An approach is proposed for supporting users to solve scheduling problems, by choosing the combination of physical manufacturing system configuration and the material handling ...
Al +48 more
core +1 more source
Integrated Production and Transportation Scheduling Method in Hybrid Flow Shop [PDF]
Chinese Journal of Mechanical Engineering, 2021 Abstract The connection between production scheduling and transportation scheduling is getting closer in smart manufacturing system, and both of those problems are summarized as NP-hard problems. However, only a few studies have considered them simultaneously.
Wangming Li +4 more
openaire +3 more sources
Scheduling Jobs in Flowshops with the Introduction of Additional Machines in the Future [PDF]
, 2008 This is the author's peer-reviewed final manuscript, as accepted by the publisher. The published article is copyrighted by Elsevier and can be found at: http://www.journals.elsevier.com/expert-systems-with-applications/.The problem of scheduling jobs to ...
A. Apostolico +15 more
core +3 more sources