Results 11 to 20 of about 1,249,401 (374)

Constraint satisfaction adaptive neural network and heuristics combined approaches for generalized job-shop scheduling [PDF]

open access: green, 2000
Copyright @ 2000 IEEEThis paper presents a constraint satisfaction adaptive neural network, together with several heuristics, to solve the generalized job-shop scheduling problem, one of NP-complete constraint satisfaction problems.
Shengxiang Yang, Dingwei Wang
openalex   +3 more sources

PENYELESAIAN MASALAH JOB SHOP MENGGUNAKAN ALGORITMA GENETIKA [PDF]

open access: yesJurnal Masyarakat Informatika, 2010
Job Shop Scheduling Problem (JSP) is a problem of work scheduling that can be describe by one or several job that have to be done by one or several source, each job contain of several operation that has to be done without interuption in several time and ...
Satriyo Adhy, Kushartantya Kushartantya
doaj   +2 more sources

Solving flexible job shop scheduling problems in manufacturing with Quantum Annealing

open access: yesProduction Engineering, 2022
Quantum Annealing (QA) is a metaheuristic for solving optimization problems in a time-efficient manner. Therefore, quantum mechanical effects are used to compute and evaluate many possible solutions of an optimization problem simultaneously.
Philipp Schworm   +3 more
semanticscholar   +1 more source

Surrogate-Assisted Evolutionary Multitask Genetic Programming for Dynamic Flexible Job Shop Scheduling

open access: yesIEEE Transactions on Evolutionary Computation, 2021
Dynamic flexible job shop scheduling (JSS) is an important combinatorial optimization problem with complex routing and sequencing decisions under dynamic environments.
Fangfang Zhang   +4 more
semanticscholar   +1 more source

The Comparison of the Integer Programming Models for Solving the Stage Shop Scheduling Problem [PDF]

open access: yesمجله مدل سازی در مهندسی, 2018
The development and extending the classic models for approaching the real world conditions are always in consideration of researchers. For this reason, many efforts are made for generalization of the job shop scheduling problem. The stage shop scheduling
Mohammad Mahdi Nasiri
doaj   +1 more source

Effective and Interpretable Rule Mining for Dynamic Job-Shop Scheduling via Improved Gene Expression Programming with Feature Selection

open access: yesApplied Sciences, 2023
Gene expression programming (GEP) is frequently used to create intelligent dispatching rules for job-shop scheduling. The proper selection of the terminal set is a critical factor for the success of GEP.
Adilanmu Sitahong   +4 more
doaj   +1 more source

Applying flexible job shop scheduling in patients management to optimize processing time in hospitals. [PDF]

open access: yesInternational Journal of Research in Industrial Engineering, 2021
The continuous growth of the population causes an increased demand for our healthcare services. Insufficient hospitals face challenges to serve the patient within a preferable duration.
N. Sarfaraj, Md. L. Lingkon, N. Zahan
doaj   +1 more source

A chaotic simulated annealing and particle swarm improved artificial immune algorithm for flexible job shop scheduling problem

open access: yesEURASIP Journal on Wireless Communications and Networking, 2018
Reasonable scheduling of flexible job shop is key to improve production efficiency and economic benefits; in order to solve the problem in flexible job shop scheduling problem, a novel flexible job shop scheduling method based on improved artificial ...
Rui Zeng, Yingyan Wang
doaj   +1 more source

Advanced Metaheuristic Method for Decision-Making in a Dynamic Job Shop Scheduling Environment

open access: yesMathematics, 2021
As a well-known NP-hard problem, the dynamic job shop scheduling problem has significant practical value, so this paper proposes an Improved Heuristic Kalman Algorithm to solve this problem.
Hankun Zhang   +3 more
doaj   +1 more source

A linear programming-based method for job shop scheduling [PDF]

open access: yes, 2012
We present a decomposition heuristic for a large class of job shop scheduling problems. This heuristic utilizes information from the linear programming formulation of the associated optimal timing problem to solve subproblems, can be used for any ...
A. P. J. Vepsalainen   +27 more
core   +4 more sources

Home - About - Disclaimer - Privacy