Results 241 to 250 of about 1,414,367 (299)

Evaluating Bio-Inspired Metaheuristics for Dynamic Surgical Scheduling: A Resilient Three-Stage Flow Shop Model Under Stochastic Emergency Arrivals. [PDF]

Biomimetics (Basel)
Becerra-Rozas M, Gana B, Lara J, Leiva-Araos A, Crawford B, Gómez Pulido JM, Contreras C, Caro-Miranda JJ, García-Remesal M.   +8 more
europepmc   +1 more source

A New Framework for Job Shop Integrated Scheduling and Vehicle Path Planning Problem. [PDF]

Sensors (Basel)
Li R, Mao J, Wu X, Zhou W, Qian C, Du H.
europepmc   +1 more source

Development of a shop floor scheduling and allocation framework for operations management excellence using cutting-edge technologies. [PDF]

Sci Rep
Tripathi V, Chattopadhyaya S, Dewangan S.   +2 more
europepmc   +1 more source

Fuzzy-based multi-objective scheduling for human-robot manufacturing systems. [PDF]

Sci Rep
Deng Y, Huang B, Lai S.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Job Shop Scheduling With Deadlines

Journal of Combinatorial Optimization, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BALAS E., LANCIA, Giuseppe, SERAFINI, Paolo, VAZACOPOULOS A.   +3 more
openaire   +3 more sources

Job-shop scheduling in a body shop

Journal of Scheduling, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Joachim Schauer, Cornelius Schwarz
openaire   +2 more sources

Scheduling the General Job-Shop

Management Science, 1985
A 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

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   +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

Scheduling the dynamic job shop

[1993] Proceedings IEEE International Conference on Robotics and Automation, 2002
The 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   +2 more sources