Results 211 to 220 of about 13,278 (264)

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

Distributed scheduling of job shops

Proceedings. 1991 IEEE International Conference on Robotics and Automation, 2002
A distributed job shop scheduling algorithm has been implemented in the LAN (local area network) environment. The algorithm is a good candidate for distributed implementation since much of the computation time required for a solution is expended in distributable portions of the algorithm.
Debra J. Hoitomt, James B. Perkins, Peter B. Luh   +2 more
openaire   +1 more source

Job shop scheduling with the option of jobs outsourcing

International Journal of Production Research, 2019
Incorporating outsourcing in scheduling is addressed by several researchers recently. However, this scope is not investigated thoroughly, particularly in the job shop environment.
Hamid Safarzadeh, Farhad Kianfar
openaire   +1 more source

Optilearning for job shop problems

1998 Second International Conference. Knowledge-Based Intelligent Electronic Systems. Proceedings KES'98 (Cat. No.98EX111), 2002
We exploit the two distinguishing features of Boltzmann machines-plasticity of connections and concentration of equilibrium states around the minima of a loss function-for designing an optimization algorithm where the neural network learns to suitably locate its equilibrium state on the target of the optimization problem. The algorithm is structured in
Bruno Apolloni, S. Bolis, Anna Maria Zanaboni   +2 more
openaire   +1 more source

Cyclic Schedules for Job Shops with Identical Jobs

Mathematics of Operations Research, 1992
We consider the problem of finding cyclic schedules for a job shop in which all jobs are identical. Specifically, we assume that a single product is produced on a finite number of machines. Each part is manufactured by performing a given set of operations in a pre-determined sequence. Each operation can be performed on exactly one machine.
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.
Sheldon X. C. Lou, Garrett J. van Ryzin, Stanley B. Gershwin   +2 more
openaire   +1 more source

On transforming job-shops into flow-shops

Production Planning & Control, 2002
In 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

Practical job shop scheduling

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

Optimal Configurations of General Job Shops

Queueing Systems, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Avi Giloni, Sridhar Seshadri
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   +1 more source