Results 51 to 60 of about 204,642 (376)
An Improved Shuffled Frog-Leaping Algorithm for Flexible Job Shop Scheduling Problem
Algorithms, 2015 The flexible job shop scheduling problem is a well-known combinatorial optimization problem. This paper proposes an improved shuffled frog-leaping algorithm to solve the flexible job shop scheduling problem. The algorithm possesses an adjustment sequence
Kong Lu +5 more
doaj +1 more source
Real-Time Hybrid Flow Shop Scheduling Approach in Smart Manufacturing Environment
Complex System Modeling and Simulation, 2021 Smart manufacturing in the “Industry 4.0” strategy promotes the deep integration of manufacturing and information technologies, which makes the manufacturing system a ubiquitous environment.
Xiuli Wu, Zheng Cao, Shaomin Wu
doaj +1 more source
Application of an evolutionary algorithm-based ensemble model to job-shop scheduling [PDF]
, 2019 In this paper, a novel evolutionary algorithm is applied to tackle job-shop scheduling tasks in manufacturing environments. Specifically, a modified micro genetic algorithm (MmGA) is used as the building block to formulate an ensemble model to undertake ...
Hanoun, Samer +7 more
core +1 more source
Complex System Modeling and Simulation, 2022 With the popularization of multi-variety and small-batch production patterns, the flexible job shop scheduling problem (FJSSP) has been widely studied. The sharing of processing resources by multiple machines frequently occurs due to space constraints in
Zhen Chen +3 more
doaj +1 more source
A Stochastic Dominance Ordering of Scheduling Rules. [PDF]
, 1979 This paper applies stochastic dominance (SD) preference-ordering criteria to job shop scheduling rules. A simulation model of a hypothetical dual-constrained job shop is used to derive several measures of shop performance for a number of dispatching/due ...
NC DOCKS at The University of North Carolina at Greensboro +1 more
core +1 more source
Jurnal Ilmiah Teknik Industri, 2005 This paper develops job shop production scheduling using Non Delay algorithm through forward and backward-forward algorithm to minimize total earliness and tardiness costs.
Dian Retno Sari Dewi
doaj +1 more source
How the Landscape of Random Job Shop Scheduling Instances Depends on the Ratio of Jobs to Machines [PDF]
Journal Of Artificial Intelligence Research, Volume 26, pages
247-287, 2006, 2011 We characterize the search landscape of random instances of the job shop scheduling problem (JSP). Specifically, we investigate how the expected values of (1) backbone size, (2) distance between near-optimal schedules, and (3) makespan of random schedules vary as a function of the job to machine ratio (N/M).
arxiv +1 more source
Flexible job shop scheduling using genetic algorithm and heuristic rules
Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2016 Job shop scheduling with the availability of more than one machine to perform an operation, also known as the flexible job shop scheduling problem, is computationally NP-hard.
Parinya KAWEEGITBUNDIT, Toru EGUCHI
doaj +1 more source
Journal of Intelligent Manufacturing, 2020 Many manufacturing systems need more than one type of resource to co-work with. Commonly studied flexible job shop scheduling problems merely consider the main resource such as machines and ignore the impact of other types of resource.
Xiuli Wu +3 more
semanticscholar +1 more source
A MILP model for an extended version of the Flexible Job Shop Problem [PDF]
, 2014 A MILP model for an extended version of the Flexible Job Shop Scheduling problem is proposed. The extension allows the precedences between operations of a job to be given by an arbitrary directed acyclic graph rather than a linear order.
Birgin, Ernesto G. +5 more
core +2 more sources