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
Algorithms, 2014 Production processes in Cellular Manufacturing Systems (CMS) often involve groups of parts sharing the same technological requirements in terms of tooling and setup. The issue of scheduling such parts through a flow-shop production layout is known as the
Antonio Costa +2 more
doaj +1 more source
An application of effective genetic algorithms for Solving Hybrid Flow Shop Scheduling Problems [PDF]
International Journal of Computational Intelligence Systems, 2008 This paper addresses the Hybrid Flow Shop (HFS) scheduling problems to minimize the makespan value. In recent years, much attention is given to heuristic and search techniques.
Cengiz Kahraman +3 more
doaj +1 more source
New Heuristic Algorithm for Flow Shop Scheduling with 3 Machines and 2 Robots Considering the Breakdown Interval of Machines and Robots Simultaneously [PDF]
Journal of Optimization in Industrial Engineering, 2016 Scheduling is an important subject of production and operations management area. In flow-shop scheduling, the objective is to obtain a sequence of jobs which when processed in a fixed order of machines, will optimize some well defined criteria.
mahdi eghbali +2 more
doaj +1 more source
Solving the Distributed Permutation Flow-Shop Scheduling Problem Using Constrained Programming
Applied Sciences, 2023 The permutation flow-shop scheduling problem is a classical problem in scheduling that aims at identifying the optimal sequence of jobs that should be processed in a number of machines in an effort to minimize makespan or some other performance criterion.
Christos Gogos
doaj +1 more source
Adaptive Preventive Maintenance for Flow Shop Scheduling With Resumable Processing
IEEE Transactions on Automation Science and Engineering, 2021 In this article, we focus on a joint scheduling problem that considers the corrective maintenance (CM) due to unexpected breakdowns and the scheduled preventive maintenance (PM) in a generic $M$ -machine flow shop.
Honghan Ye, Xi Wang, Kaibo Liu
semanticscholar +1 more source
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
The Complexity of Mean Flow Time Scheduling Problems with Release Times
, 2006 We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time.
Baptiste, Philippe +5 more
core +3 more sources
A decomposition based algorithm for flexible flow shop scheduling with machine breakdown [PDF]
, 2009 Research on flow shop scheduling generally ignores uncertainties in real-world production because of the inherent difficulties of the problem. Scheduling problems with stochastic machine breakdown are difficult to solve optimally by a single approach ...
Choi, SH, Wang, K
core +1 more source
FEBS Letters, EarlyView.Exposure to common noxious agents (1), including allergens, pollutants, and micro‐nanoplastics, can cause epithelial barrier damage (2) in our body's protective linings. This may trigger an immune response to our microbiome (3). The epithelial barrier theory explains how this process can lead to chronic noncommunicable diseases (4) affecting organs ...
Can Zeyneloglu +17 more
wiley +1 more source