Results 1 to 10 of about 2,350 (264)
Job Shop Scheduling by Simulated Annealing [PDF]
Operations Research, 1992 We describe an approximation algorithm for the problem of finding the minimum makespan in a job shop. The algorithm is based on simulated annealing, a generalization of the well known iterative improvement approach to combinatorial optimization problems.
Jan Karel Lenstra
exaly +2 more sources
Job Shop Scheduling by Local Search [PDF]
INFORMS Journal on Computing, 1996 We survey solution methods for the job shop scheduling problem with an emphasis on local search. Both deterministic and randomized local search methods as well as the proposed neighborhoods are discussed. We compare the computational performance of the various methods in terms of their effectiveness and efficiency on a standard set of problem ...
J K Lenstra, E H L Aarts
exaly +2 more sources
Research on Priority-based Flexible Job Shop Scheduling Algorithm [PDF]
E3S Web of Conferences, 2021 Research on the Flexible Job Shop Scheduling (FJSP) problem in the manufacturing process of aircraft engines has been carried out. It is found that there are real requirements such as order mandatory nodes and equipment selection in the current job ...
Liu Manxing, Xia Xiufeng
doaj +1 more source
A Research Review on Job Shop Scheduling Problem [PDF]
E3S Web of Conferences, 2021 In recent years, the manufacturing industry has developed rapidly with fierce competition. Manufacturing enterprises are faced with the challenge of on-time delivery, multiple product choices and quick response to order modification.
Yu Yingchen
doaj +1 more source
Applying flexible job shop scheduling in patients management to optimize processing time in hospitals. [PDF]
International 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
Machines, 2021 The flexible job shop scheduling problem has always been the focus of research in the manufacturing field. However, most of the previous studies focused more on efficiency and ignored energy consumption.
Mingliang Wu +7 more
doaj +1 more source
A precedence constrained flow shop scheduling problem with transportation time, breakdown times, and weighted jobs [PDF]
Journal of Project Management, 2022 Job precedence can often be seen in various manufacturing process scenarios. For instance, in the context of flow shop scheduling, certain jobs must be processed before a specific job may be executed.
M. Thangaraj +2 more
doaj +1 more source
Advanced Metaheuristic Method for Decision-Making in a Dynamic Job Shop Scheduling Environment
Mathematics, 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
The Comparison of the Integer Programming Models for Solving the Stage Shop Scheduling Problem [PDF]
مجله مدل سازی در مهندسی, 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
Axioms, 2022 The energy-saving scheduling problem (ESSP) has gained increasing attention of researchers in the manufacturing field. However, there is a lack of studies on ESSPs in the assembly job shop environment.
Tianhua Jiang +3 more
doaj +1 more source