Results 1 to 10 of about 70 (69)
On the Job-Shop Scheduling Problem [PDF]
This is a proposal for the application of discrete linear programming to the typical job-shop scheduling problem—one that involves both sequencing restrictions and also noninterference constraints for individual pieces of equipment. Thus far, no attempt has been made to establish the computational feasibility of the approach in the case of large-scale
openaire +1 more source
Job Shop Scheduling by Simulated Annealing [PDF]
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.
Laarhoven, van, P.J.M. +2 more
openaire +1 more source
Optimal job insertion in the no-wait job shop
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Reinhard Bürgy, Heinz Gröflin
openaire +3 more sources
Job Shop Scheduling by Local Search [PDF]
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 ...
Rob J. M. Vaessens +2 more
openaire +1 more source
Job selection in a heavily loaded shop [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
Variational approach for Job Shop Scheduling
This paper proposes a novel Variational Graph-to-Scheduler (VG2S) framework for solving the Job Shop Scheduling Problem (JSSP), a critical task in manufacturing that directly impacts operational efficiency and resource utilization. Conventional Deep Reinforcement Learning (DRL) approaches often face challenges such as non-stationarity during training ...
Seung Heon Oh +5 more
openaire +2 more sources
Some of the next articles are maybe not open access.
A Tactical Planning Model for a Job Shop
Operations Research, 1986We propose and develop a discrete-time, continuous-flow model for studying the operation of a job shop that sees a stationary input mix of job types. We are not concerned with issues of detailed scheduling, but rather hope to develop a tactical planning tool for a job-shop operation.
Stephen Clyde Graves
exaly +4 more sources
Job-shop scheduling in a body shop
Journal of Scheduling, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Joachim Schauer, Cornelius Schwarz
openaire +2 more sources
Job Shop Scheduling With Deadlines
Journal of Combinatorial Optimization, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BALAS E. +3 more
openaire +3 more sources
On the complexity of proportionate open shop and job shop problems
Optimization Letters, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abdennour Azerine +2 more
openaire +3 more sources

