Results 251 to 260 of about 3,286,488 (310)

Approximability of flow shop scheduling

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

Multiobjective flow-shop scheduling

Naval Research Logistics, 1990
Summary: Previous research on the scheduling of multimachine systems has generally focused on the optimization of individual performance measures. This article considers the sequencing of jobs through a multimachine flow shop, where the quality of the resulting schedule is evaluated according to the associted levels of two scheduling criteria, schedule
Daniels, Richard L., Chambers, Robert J.
openaire   +2 more sources

Routing open shop and flow shop scheduling problems

European Journal of Operational Research, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wei Yu 0011, Zhaohui Liu 0001, Leiyang Wang, Tijun Fan   +3 more
openaire   +3 more sources

Flow Shops and Flexible Flow Shops (Deterministic)

2008
In many manufacturing and assembly facilities each job has to undergo a series of operations. Often, these operations have to be done on all jobs in the same order implying that the jobs have to follow the same route. The machines are then assumed to be set up in series and the environment is referred to as a flow shop.
openaire   +1 more source

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 ...
Richard L. Daniels, Joseph B. Mazzola
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

An Ordered Flow Shop with Two Agents

Asia-Pacific Journal of Operational Research, 2016
In this paper, we consider a two-agent scheduling problem in an [Formula: see text]-machine ordered flow shop where each agent is responsible for his own set of jobs and wishes to minimize the makespan. Since the problem is NP-hard, we develop a pseudo-polynomial time approach for the case with a fixed number of machines and investigate the conditions
Byung-Cheon Choi, Myoung-Ju Park
openaire   +1 more source

Proportionate Flow Shop Scheduling with Rejection

Asia-Pacific Journal of Operational Research, 2017
We consider the problem of scheduling [Formula: see text] jobs with rejection on a set of [Formula: see text] machines in a proportionate flow shop system where the job processing times are machine-independent. The goal is to find a schedule to minimize the scheduling cost of all accepted jobs plus the total penalty of all rejected jobs.
Shi-Sheng Li, De-Liang Qian, Ren-Xia Chen   +2 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