A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Filters
Stochastic single machine scheduling problem as a multi-stage dynamic random decision process
2021
Computational Management Science
Preserved Fulltext
Then, by looking at the problem as a multi-stage dynamic random decision process, a new deterministic approximation-based formulation is developed. ...
AbstractIn this work, we study a stochastic single machine scheduling problem in which the features of learning effect on processing times, sequence-dependent setup times, and machine configuration selection ...
as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. ...
doi:10.1007/s10287-020-00386-1
fatcat:5udapx3gerdjfhqy7yfskuajee
Flow-shop scheduling problem under uncertainties: Review and trends
2017
International Journal of Industrial Engineering Computations
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Flow-shop (FS) scheduling problems encompass the sequencing processes in environments in which the activities or operations are performed in a serial flow. ...
Nevertheless, in real-world situations, events are frequently subject to uncertainties that can affect the decision-making process. ...
Makespan, as in many other scheduling problems, is the most frequently evaluated metric, being considered by 64% of single-objective and 73% of multi-objective papers (see Table 4 ). ...
doi:10.5267/j.ijiec.2017.2.001
fatcat:ebefsxncxvdz3nazi327q4yuw4
Robust single-track train dispatching model under a dynamic and stochastic environment: A scenario-based rolling horizon solution approach
2011
Transportation Research Part B: Methodological
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
After a major service disruption on a single-track rail line, dispatchers need to generate a series of train meet-pass plans at different decision times of the rescheduling stage. ...
Based on a stochastic programming with recourse framework, this paper incorporates different probabilistic scenarios in the rolling horizon decision process to recognize (1) the input data uncertainty ...
Oliveira and Smith (2000) and Oliveira (2001) formulated the train scheduling problem for a single track railroad network as a job shop scheduling problem. ...
doi:10.1016/j.trb.2011.05.001
fatcat:bymgla4ibze3bdsz6tr45teuyy
Towards Understanding Uncertainty in Cloud Computing Resource Provisioning
2015
Procedia Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We review main sources of uncertainty, fundamental approaches for scheduling under uncertainty such as reactive, stochastic, fuzzy, robust, etc. ...
The vast majority of the research efforts in scheduling assumes complete information about the scheduling problem and a static deterministic execution environment. ...
At the first stage, jobs are allocated to a suitable machine, while at the second stage, local scheduling is independently applied to each machine. ...
doi:10.1016/j.procs.2015.05.387
fatcat:slgh4s5c75efrgkprepjpkcqdq
A mathematical model for the product mixing and lot-sizing problem by considering stochastic demand
2017
International Journal of Industrial Engineering Computations
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This paper aims to develop a general model for the product-mix, and lot size decision within a stochastic demand environment, by introducing the Economic Value Added (EVA) as the objective function of ...
Several heuristics and metaheuristics have been developed to deal with lot decisions problems, in order to obtain high quality results within short commuting times. ...
In addition, both categories could be divided in the following subcategories: single item and multi-item problems, uncapacitated and capacitated problems, and single stage and multistage problems. ...
doi:10.5267/j.ijiec.2016.9.003
fatcat:o6rxt6cjjbhcngtqgtad6igc4m
Stochastic Reactive Production Scheduling by Multi-agent Based Asynchronous Approximate Dynamic Programming
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
To achieve this, the scheduling problem is reformulated as a special Markov Decision Process. A near-optimal control policy of the resulted MDP is calculated in a homogeneous multi-agent system. ...
The paper investigates a stochastic production scheduling problem with unrelated parallel machines. A closed-loop scheduling technique is presented that on-line controls the production process. ...
Stochastic Reactive Scheduling as a MDP In this section a dynamic stochastic scheduling problem is formulated as a Markov Decision Process. ...
doi:10.1007/11559221_39
fatcat:bbrwxafcq5ev3i3kh4uugd5txa
The stochastic economic lot scheduling problem: A survey
2011
European Journal of Operational Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We consider the production of multiple standardized products on a single machine with limited capacity and set-up times under random demands and random production times, i.e., the so-called stochastic ...
economic lot scheduling problem (SELSP). ...
Doug Down is acknowledged for pointing our attention to the strategy originating from the FDDI protocol as described in Section 5 of the present paper. ...
doi:10.1016/j.ejor.2010.06.011
fatcat:xd2pczxadvdrvlhvxycngecoou
Page 655 of The Journal of the Operational Research Society Vol. 55, Issue 6
[page]
2004
The Journal of the Operational Research Society
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Control limits for multi-stage manufacturing processes with binomial yield (single and multi- ple production runs). J Opl Res Soc 47: 98-112.
Gerchak Y, Wang Y and Yano CA (1994). ...
Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley: New York.
Sennott LI (1999). Stochastic Dynamic Programming and the Control of Queueing Systems. Wiley: New York. ...
A Critical Analysis of Job Shop Scheduling in Context of Industry 4.0
2021
Sustainability
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Scheduling plays a pivotal role in the competitiveness of a job shop facility. The traditional job shop scheduling problem (JSSP) is centralized or semi-distributed. ...
With the advent of Industry 4.0, there has been a paradigm shift in the manufacturing industry from traditional scheduling to smart distributed scheduling (SDS). ...
[104] solved the multi-stage JSSP problem under FMS. ...
doi:10.3390/su13147684
fatcat:2nce4laeezfxdmcy2r6hfchr5y
5-17,Tesma305,IJEAST.pdf
2018
Figshare
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
A variety of approaches have been developedto solve the problem of dynamic scheduling. ...
The scheduling problems are classified based onthe nature of the shop configuration into five classes, i.e.,single machine, parallel machines, flow shop, job shop, andopen shop. ...
A scheduling method based on variable neighborhood search (VNS) was proposed for dynamic job shop scheduling problem with random job arrivals and machine breakdowns (M. A.Adibi 2010). ...
doi:10.6084/m9.figshare.7379393
fatcat:fcdzn7qcpva2lpvzd6kkhxftfu
Multi-Stage Multi-Product Production and Inventory Planning for Cold Rolling under Random Yield
2022
Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
This paper studies a multi-stage multi-product production and inventory planning problem with random yield derived from the cold rolling process in the steel industry. ...
The process also experiences random yield. ...
The above research on cold rolling planning and scheduling problems mainly focuses on decisions about batching and sequencing coils on machines in a single stage. ...
doi:10.3390/math10040597
fatcat:upn6updwbjbn5amaerlr4rccgu
Special issue on the 12th international conference on computational management science
2017
Computational Management Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
These include computational economics, finance and statistics, energy, scheduling, supply chains, design, analysis and applications of optimisation algorithms, deterministic, dynamic, stochastic, robust ...
The third paper, authored by Dupačová and Kozmík, proposes a new preprocessing technique for stochastic dual dynamic programs (SDDPs) that can significantly reduce the computation times. ...
While the classical fixed interval scheduling problems are deterministic, practical problems are often characterized by random delays in the job processing times. ...
doi:10.1007/s10287-017-0273-x
fatcat:4lmgvnylznebndzblw3yqnrhkq
Hybrid Multi-agent System for Cooperative Dynamic Scheduling Through Meta-Heuristics
2007
Seventh International Conference on Intelligent Systems Design and Applications (ISDA 2007)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This work has as objective to deal with the complex problem of Dynamic Scheduling in Manufacturing Systems. ...
In this paper we will model a Manufacturing System by means of a Multi-Agent Systems, where each agent may represent a processing entity. ...
Problem Definition The scheduling problem can be seen as a decision making process for operations starting and resources to be used. ...
doi:10.1109/isda.2007.50
dblp:conf/isda/MadureiraSG07
fatcat:el2spssmkbat7oovzoo6ekgznm
Stochastic scheduling of active support vector learning algorithms
2005
Proceedings of the 2005 ACM symposium on Applied computing - SAC '05
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
One of the proposed algorithms is inspired by online decision problems, and involves a hard choice among the pure strategies at each step. ...
However, it is observed that a better scheme would be to use random learning in the initial stages (more exploration) and query learning in the final stages (more exploitation) of learning. ...
MULTI-ARMED BANDIT, ACTIVE LEARN-ING AND STOCHASTIC SCHEDULING The Multi-armed bandit (MAB) problem is a well studied problem in stochastic scheduling and dynamic allocation. ...
doi:10.1145/1066677.1066689
dblp:conf/sac/PandeyGM05
fatcat:7bd2lss7frcvblhqatln5ogd2m
The lot sizing problem: A tertiary study
2014
International Journal of Production Economics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Our analysis shows that various extensions of Harris' lot size model were developed over the years, such as lot sizing models that include multi-stage inventory systems, incentives, or productivity issues ...
Abstract: This paper provides a survey of literature reviews in the area of lot sizing. ...
Single stage single machine-models include the economic lot scheduling problem (ELSP), where multiple products are produced on a single machine in a cyclic pattern, as well as the joint replenishment problem ...
doi:10.1016/j.ijpe.2013.12.009
fatcat:u6phyex3vngipgdnnlg63p2i3y
« Previous
Showing results 1 — 15 out of 10,249 results