Results 281 to 290 of about 729,097 (348)
A novel dynamic scheduling model for application in multimode approach. [PDF]
Sci RepElqabli Z, Kamach O, Khatab A, Chater Y.
europepmc +1 more source
Modelagem do processo de programação detalhada da produção em ambiente Job Shop
, 2009 Sérgio Rocha Barcellos
openalex +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
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
IFAC Proceedings Volumes, 1989
Abstract A periodic version of the Job Shop Problem is presented, in which each task has to be repeated at a given rate in identical conditions. Constraints arising from job sequences, machine capacities, limited size of buffers and transportation times between machines are considered and their modelization is explained.
SERAFINI, Paolo, UKOVICH W.
openaire +2 more sources
Abstract A periodic version of the Job Shop Problem is presented, in which each task has to be repeated at a given rate in identical conditions. Constraints arising from job sequences, machine capacities, limited size of buffers and transportation times between machines are considered and their modelization is explained.
SERAFINI, Paolo, UKOVICH W.
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
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
On transforming job-shops into flow-shops
Production Planning & Control, 2002In this paper the problem of transforming a job-shop environment into a flow-shop is addressed, where scheduling issues are simpler and pull production control systems might be easily applied. A linear programming model employing machine investment minimization as objective function is proposed.
Jose M. Framinan, Rafael Ruiz-Usano
openaire +1 more source
Job-shop scheduling in a body shop
Journal of Scheduling, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Schauer, Joachim, Schwarz, Cornelius
openaire +2 more sources