Results 281 to 290 of about 85,049 (338)

Flow Shop Scheduling with Resource Flexibility

Operations Research, 1994
This paper explores the improvements in manufacturing efficiency that can be achieved by broadening the scope of production scheduling to include both the sequencing of work and the coordination of the resource inputs required to perform work. Recognizing that some resources are inherently flexible and thus can be reassigned dynamically to processing ...
Joseph B. Mazzola, Richard L. Daniels
openaire   +2 more sources

Flow shop scheduling with lot streaming

Operations Research Letters, 1989
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chris N. Potts, Kenneth R. Baker
openaire   +2 more sources

Approximability of flow shop scheduling

Mathematical Programming, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Flow-shop scheduling with flexible processors

Computers & Operations Research, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chien-Lin Sun, Ching-Jong Liao, Wen-Ching You   +2 more
openaire   +2 more sources

Flow Shop Scheduling

2019
Consider scheduling tasks on dedicated processors or machines. We assume that tasks belong to a set of n jobs, each of which is characterized by the same machine sequence.
Malgorzata Sterna, Günter Schmidt, Günter Schmidt, Erwin Pesch, Jan Węglarz, Klaus H. Ecker, Jacek Blazewicz, Jacek Blazewicz   +7 more
openaire   +2 more sources

Scheduling in network flow shops

Journal of Global Optimization, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

FLOW SHOP SCHEDULING WITH REINFORCEMENT LEARNING

Asia-Pacific Journal of Operational Research, 2013
Reinforcement learning (RL) is a state or action value based machine learning method which solves large-scale multi-stage decision problems such as Markov Decision Process (MDP) and Semi-Markov Decision Process (SMDP) problems. We minimize the makespan of flow shop scheduling problems with an RL algorithm. We convert flow shop scheduling problems into
ZHICONG ZHANG, WEIPING WANG, SHOUYAN ZHONG, KAISHUN HU   +3 more
openaire   +3 more sources

Scheduling in Flow and Open Shops

1996
Consider scheduling tasks on dedicated processors or machines. We assume that tasks belong to a set of n jobs, each of which is characterized by the same machine sequence. For convenience, let us assume that any two consecutive tasks of the same job are to be processed on different machines.
Jan Węglarz, Erwin Pesch, Klaus H. Ecker, Günter Schmidt, Jacek Blazewicz   +4 more
openaire   +2 more sources

A contribution to the stochastic flow shop scheduling problem

European Journal of Operational Research, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gourgand, Michel, Grangeon, Nathalie, Norre, Sylvie   +2 more
openaire   +4 more sources

Scheduling optimization of flexible flow shop [PDF]

2018 IEEE 4th Information Technology and Mechatronics Engineering Conference (ITOEC), 2018
According to the production characteristics of flexible job shop scheduling in practice, the initial solution is generated by random Numbers, Gantt chart is drawn, and the maximum process time is calculated. Then, a simplified algorithm is proposed with reference to Johnson's algorithm.
Xuefeng Liu, Lingmin Dai, Zhenhui Shen
openaire   +1 more source