Results 31 to 40 of about 129,345 (335)
Flow shop scheduling with heterogeneous workers
European Journal of Operational Research, 2014 We propose an extension to the flow shop scheduling problem named Heterogeneous Flow Shop Scheduling Problem (Het-FSSP), where two simultaneous issues have to be resolved: finding the best worker assignment to the workstations, and solving the corresponding scheduling problem. This problem is motivated by Sheltered Work centers for Disabled, whose main
Benavides, Alexander J. +2 more
openaire +2 more sources
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
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
Job Shop Scheduling Benchmark: Environments and Instances for Learning and Non-learning Methods [PDF]
arXiv, 2023 Job shop scheduling problems address the routing and sequencing of tasks in a job shop setting. Despite significant interest from operations research and machine learning communities over the years, a comprehensive platform for testing and comparing solution methods has been notably lacking.
arxiv
The Dominance Flow Shop Scheduling Problem
Electronic Notes in Discrete Mathematics, 2018 Fil: Rossit, Daniel Alejandro. Consejo Nacional de Investigaciones Cientificas y Tecnicas. Centro Cientifico Tecnologico Conicet - Bahia Blanca. Instituto de Matematica Bahia Blanca. Universidad Nacional del Sur. Departamento de Matematica.
Rossit, Daniel Alejandro +4 more
openaire +3 more sources
Self-encoding Barnacle Mating Optimizer Algorithm for Manpower Scheduling in Flow Shop [PDF]
arXiv, 2021 Flow Shop Scheduling (FSS) has been widely researched due to its application in many types of fields, while the human participant brings great challenges to this problem. Manpower scheduling captures attention for assigning workers with diverse proficiency to the appropriate stages, which is of great significance to production efficiency.
arxiv
Robust multi-objective hybrid flow shop scheduling
Journal of Applied Research on Industrial Engineering, 2021 Scheduling is an important decision-making process that aims to allocate limited resources to the jobs in a production process. Among scheduling problems, Hybrid Flow Shop (HFS) scheduling has good adaptability with most real world applications including
Behnaz Zanjani +3 more
doaj +1 more source
Population Ecology, EarlyView.In the process of captive breeding and reintroduction of endangered animal species, it is crucial to minimize familial bias in reproductive success during the reintroduction phase to preserve genetic diversity. In this study, we attempted to identify the familial lineage of individuals of the endangered bagrid fish Tachysurus ichikawai born at the ...
Hinano Mizuno +5 more
wiley +1 more source
Switched max-plus linear-dual inequalities for makespan minimization: the case study of an industrial bakery shop [PDF]
arXiv, 2022 In this paper, an industrial bakery shop is modeled by switched max-plus linear-dual inequalities (SLDIs). SLDIs are timed discrete event systems suitable for describing flow shops with time-window constraints and switching operating modes, where each mode corresponds to a job type.
arxiv