Results 261 to 270 of about 23,175 (311)
Some of the next articles are maybe not open access.

Practical job shop scheduling

Annals of Operations Research, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +6 more sources

A Periodic Job Shop Model

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   +3 more sources

A model for job-shop problem

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   +2 more sources

Job shop control

International Journal of Production Research, 1981
Abstract The paper defines batch or job shop production and reviews the functions of production planning and production control in a job shop manufacturing situation. It argues that the separation of planning and control has resulted in the artificial isolation of the sequencing problem in job shop research.
B. J. Davies, J. E. Boonj, Jim Browne
openaire   +2 more sources

Job Shop Scheduling [PDF]

open access: possible, 1992
The job shop scheduling problem is described as follows. Given are a set of jobs and a set of machines. Each machine can handle at most one job at a time. Each job consists of a chain of operations, each of which needs to be processed during an uninterrupted time period of a given length on a given machine.
openaire   +1 more source

Job Shops (Deterministic)

2008
This chapter deals with multi operation models that are different from the flow shop models discussed in the previous chapter. In a flow shop model all jobs follow the same route. When the routes are fixed, but not necessarily the same for each job, the model is called a job shop. If a job in a job shop has to visit certain machines more than once, the
openaire   +2 more sources

Job-Shop Execution [PDF]

open access: possible, 1996
Once the management requirements planning (MRP) system has projected a plan, the remaining task is to execute the plan. Through proper consideration of capacity, the evolving plan may be doable, but “doing it”—the execution— can be most challenging, especially in a job-shop environment. MRP was developed as a tool to assist in the complicated dependent
openaire   +1 more source

Analysis of Job Flow-Time in a Job Shop [PDF]

open access: possibleJournal of the Operational Research Society, 1985
This paper is concerned with analytical determination of the mean and standard deviation of the job flow-time in a job shop in which the F.C.F.S dispatching rule is in use. A hypothetical job shop is constructed to generate simulation results for comparison with the analytical results.
openaire   +1 more source

Flow Shops, Job Shops and Open Shops (Stochastic)

2008
The results for stochastic flow shops, job shops, and open shops are somewhat less extensive than those for their deterministic counterparts.
openaire   +2 more sources

Scheduling job shops with delays

Proceedings. 1987 IEEE International Conference on Robotics and Automation, 1991
In this paper, the presence of delay in a job shop is addressed. We show that delay is an important consideration in many manufacturing systems that are modeled as continuous flow processes. A scheduling policy for a job shop with delays is then derived using theoretical arguments and heuristics.
Stanley B. Gershwin   +2 more
openaire   +3 more sources

Home - About - Disclaimer - Privacy