Results 151 to 160 of about 84,439 (205)
Some of the next articles are maybe not open access.
Proportionate Flow Shop Scheduling with Rejection
Asia-Pacific Journal of Operational Research, 2017We 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.
Li, Shi-Sheng +2 more
openaire +2 more sources
Flow Shop Scheduling with Resource Flexibility
Operations Research, 1994This 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 ...
Daniels, Richard L., Mazzola, Joseph B.
openaire +1 more source
FLOW SHOP SCHEDULING WITH REINFORCEMENT LEARNING
Asia-Pacific Journal of Operational Research, 2013Reinforcement 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 +3 more
openaire +3 more sources
Heuristics for flow-shop scheduling
International Journal of Production Research, 1980Existing methods are reviewed and new heuristics examined and developed for the flow-shop scheduling problem. Comparative tests are carried out using simulation methods on different sizes of problem and with different variability of processing time data.
J. R. KING, A. S. SPACHIS
openaire +1 more source
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.
Jacek Blazewicz +5 more
openaire +1 more source
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.
Jacek Blazewicz +5 more
openaire +1 more source
Scheduling flow shops with operators
International Journal of Production Research, 2018This paper addresses the problem of assigning a number of operators, less than the number of machines, in a flow shop environment. We study two different problems. The first is the assignment of operators subject to a fixed job sequence; the second is on handling simultaneously the assignment of operators and the scheduling of jobs on the machines.
Imène Benkalai +2 more
openaire +2 more sources
Routing open shop and flow shop scheduling problems
European Journal of Operational Research, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yu, Wei +3 more
openaire +2 more sources
Surgical Scheduling Based on Hybrid Flow-Shop Scheduling
Applied Mechanics and Materials, 2012The efficient surgical scheduling of the operating theatre plays a significant role in hospital’s income and cost. Currently surgical scheduling only considered the surgery process in operating room and ignored other stages which should not be left out in real situations.
Guo Xun Huang +6 more
openaire +1 more source
Proportionate flow-shop scheduling with rejection
Journal of the Operational Research Society, 2016In many heavily loaded manufacturing systems, managers routinely make use of outsourcing options in order to maintain reasonable Quality of Service for customers. Thus, there is a strong need to provide tools for managers to economically coordinate sourcing and scheduling decisions.
Dvir Shabtay, Daniel Oron
openaire +1 more source