Results 201 to 210 of about 13,278 (264)
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. With the model, we are able to characterize the operational behavior
Stephen C Graves
exaly +3 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
Scheduling the General Job-Shop
Management Science, 1985A family of algorithms is described for finding optimum schedules for job-shops. The algorithms are of a branch and bound type but have a complete schedule associated with each node of the search tree. Branching from nodes is based on important conflicts in the schedule. Some results are provided.
Jeffrey R. Barker, Graham B. McMahon
openaire +1 more source
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 +2 more sources
The Quarterly Journal of Economics, 1978
I. Introduction, 261.—II. The basic model—risk neutrality, 262.—III. Mobility cost, 268.—IV. Education, 270.—V. Extensions of the basic model, 272.—VI. Empirical applications, 274.
openaire +2 more sources
I. Introduction, 261.—II. The basic model—risk neutrality, 262.—III. Mobility cost, 268.—IV. Education, 270.—V. Extensions of the basic model, 272.—VI. Empirical applications, 274.
openaire +2 more sources
2012 International Conference on Information Technology and e-Services, 2012
In this paper, we present a timed model called Resources Allocation Timed Automata (RATA), expressing parallel behaviors in natural way and supporting at the same time explicit action duration and shared resources. We show how the classical job-shop scheduling problem can be modeled naturally in RATA model, we present also two algorithms for finding ...
Arfi, Farid +2 more
openaire +1 more source
In this paper, we present a timed model called Resources Allocation Timed Automata (RATA), expressing parallel behaviors in natural way and supporting at the same time explicit action duration and shared resources. We show how the classical job-shop scheduling problem can be modeled naturally in RATA model, we present also two algorithms for finding ...
Arfi, Farid +2 more
openaire +1 more source
A genetic algorithm for job shop
Proceedings. 1991 IEEE International Conference on Robotics and Automation, 2002Genetic algorithms (GAs) constitute a technique that has been applied with advantage to a variety of combinatorial problems. This work shows how the GAs can be used to optimize the job shop problem with many tasks, many machines, and precedence constraints.
Emanuel Falkenauer, S. Bouffouix
openaire +1 more source
Scheduling the dynamic job shop
[1993] Proceedings IEEE International Conference on Robotics and Automation, 2002The augmented Lagrangian decomposition and coordination technique is applied to a continuous-time formulation of the scheduling problem in a job shop environment. This methodology generates a variety of information that can be used to initialize the algorithm after changes occur, including Lagrange multipliers.
Debra J. Hoitomt, Peter B. Luh
openaire +1 more source