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.
Filters
Introduction to the special issue: project scheduling under uncertainty
2007
Journal of Scheduling
Preserved Fulltext
Erschler describes a robust approach for the single machine scheduling problem with ready times and maximum lateness objective. ...
Scheduling for stability in single-machine production systems by R. Leus and W. Herroelen presents a model for single-machine scheduling with stability objective and a common deadline. ...
doi:10.1007/s10951-007-0009-9
fatcat:r62nz4ia3jc2xfwszky6auxq2e
Scheduling (Dagstuhl Seminar 13111)
2013
Dagstuhl Reports
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.
The primary objective of the seminar is to facilitate dialog and collaboration between researchers in two different mathematically-oriented scheduling research communities, the stochastic scheduling and ...
This report documents the program and the outcomes of Dagstuhl Seminar 13111 "Scheduling". ...
problem on a single machine. ...
doi:10.4230/dagrep.3.3.24
dblp:journals/dagstuhl-reports/AlbersBP13
fatcat:f3jsoas3o5ewdl2wuvwz7kfpte
A stochastic scheduling algorithm for precedence constrained tasks on Grid
2011
Future generations computer systems
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 is a difficult problem and few efforts have been reported on its solution in the literature. The problem is first formulated in a form of stochastic scheduling model on Grid systems. ...
Then, a stochastic heterogeneous earliest finish time (SHEFT) scheduling algorithm is developed that incorporates the expected value and variance of stochastic processing time into scheduling. ...
Acknowledgements The authors would like to thank the anonymous reviewers for their valuable comments and suggestions. This ...
doi:10.1016/j.future.2011.04.007
fatcat:eb6yqbctxraqvlk6hmkuxrk2ve
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.
Scheduling has been mostly investigated for the deterministic cases, in which all parameters are known in advance and do not vary over time. ...
Flow-shop (FS) scheduling problems encompass the sequencing processes in environments in which the activities or operations are performed in a serial flow. ...
This characteristic can be used when a machine can process batches and jobs have different sizes Machines can process a batch of jobs simultaneously When the buffer capacities between machines in an FS ...
doi:10.5267/j.ijiec.2017.2.001
fatcat:ebefsxncxvdz3nazi327q4yuw4
Optimal Factory Scheduling using Stochastic Dominance A*
[article]
2013
arXiv
pre-print
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.
We examine a standard factory scheduling problem with stochastic processing and setup times, minimizing the expectation of the weighted number of tardy jobs. ...
We present an improved state-space search formulation for these problems and discuss the conditions under which stochastic scheduling problems can be solved optimally using SDA*. ...
Acknowledgements We are gratefu l to the anonymous reviewers and stu dents in the U-M Decision Machines Group for sug gestions about the presentation of this work. ...
arXiv:1302.3611v1
fatcat:nqob627czvgpvm35imnbo6nepm
Page 7585 of Mathematical Reviews Vol. , Issue 94m
[page]
1994
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Summary: “This paper considers the single-item discrete lotsizing and scheduling problem (DLSP). ...
A vari- ation of the second problem can be used to solve the problem of minimizing the makespan when there is a rolling horizon.”
94m:90057 90B35
Pandelis, Dimitrios G. (1-MI-EE; Ann Arbor, MI);
Teneketzis ...
Shop floor lot-sizing and scheduling with a two-stage stochastic programming model considering uncertain demand and workforce efficiency
2017
Computers & industrial engineering
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.
In this study, a two-stage stochastic programming model is proposed to solve a single-machine, multi-product shop floor lot-sizing and scheduling problem. ...
In this study, a two-stage stochastic programming model is proposed to solve a single-machine, multi-product shop floor lot-sizing and scheduling problem. ...
To an extent, this shows the necessity of planning the production for an entire year-cycle when time capacity varies dramatically during the production cycle. ...
doi:10.1016/j.cie.2017.07.014
fatcat:beacivu4sffhnocrnkkumhbs7u
SLO-aware colocation of data center tasks based on instantaneous processor requirements
2017
Proceedings of the 2017 Symposium on Cloud Computing - SoCC '17
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.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2017 pre-print arXiv:1709.01384v1 fatcat:xrbiy5efqze2jm3j2cjqv6sla4
In our simulation experiments, GPA resulted in colocations exceeding the machines' capacity with a frequency similar to the requested SLO. ...
Such colocation results in more efficient utilization of machines, but, when tasks' requirements exceed available resources, some of the tasks might be throttled down or preempted. ...
However, the scheduler is more concerned with the total CPU demand of the tasks colocated on a single physical machine. ...
doi:10.1145/3127479.3132244
dblp:conf/cloud/JanusR17
fatcat:p4lj52bcn5egndtgjkgndozkmq
Page 6989 of Mathematical Reviews Vol. , Issue 91M
[page]
1991
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
The process- ing time of each job on each machine as well as the capacity of each machine are given. ...
The authors consider the problem of assigning a given set of n jobs to m parallel machines (each job to exactly one machine) so as to maximize the slack capacity on the machine which is utilized the most ...
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.
The vast majority of the research efforts in scheduling assumes complete information about the scheduling problem and a static deterministic execution environment. ...
usage of shared resources by other VMs assigned to the same host machine. ...
The authors address stochastic online scheduling policies on a single and identical parallel machines to minimize the expected value of the weighted completion times of jobs. ...
doi:10.1016/j.procs.2015.05.387
fatcat:slgh4s5c75efrgkprepjpkcqdq
Stochastic cell loading to minimize nT subject to maximum acceptable probability of tardiness
2015
Journal of manufacturing systems
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.
In this paper, stochastic cell loading problem is addressed. ...
It is recommended to work with the safest schedule (0% risk), when the operation time variance is significantly high. ...
Acknowledgements As the researchers, we would like to express our gratitude to the editor, Dr. Duffie for his timely responses, assistance and guidance during the reviewing process. ...
doi:10.1016/j.jmsy.2014.11.018
fatcat:yweevupsbzghllaryzkhs5memq
Scheduling under Uncertainty for Single-Hub Intermodal Freight System
2011
Transportation Research Record
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.
This work focuses on the scheduling problem and develops an approach that would help the system operator reduce the overall system cost while taking into account the constraints arising in actual intermodal ...
This thesis addresses the optimization of an intermodal system with freight transfers at a single hub. ...
Machine Scheduling The problem statement of this thesis is analogous in some ways to a scheduling problem for parallel machines with stochastic duration of jobs and deterministic due dates. ...
doi:10.3141/2238-04
fatcat:qk5qat63cneljpmx7ivr5tbii4
Scheduling in A Single-Stage, Multi-Item Compatible Process Using Multiple ARC Network Model and Excel Solver
2018
International Review of Management and Business 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 2018; you can also visit the original URL.
The file type is application/pdf.
The problem of scheduling a given set of machines in a single-stage, multi-item compatible environment, with the objective of maximizing capacity utilization has been formulated (Bokkasam, 2016) as a maximal ...
The model provides optimal production schedule with an objective of maximizing capacity utilization, so that the customer-wise delivery schedules are fulfilled, keeping in view the priorities of the customers ...
Acknowledgement This paper is supported by the Deanship of Graduate Studies and Research at Dar Al Uloom University, Riyadh. ...
doi:10.30543/7-1(2018)-3
fatcat:z4sxvz72wffhjdf4ynurevxmcq
Queueing-theoretic approaches for dynamic scheduling: A survey
2014
Surveys in Operations Research and 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 2017; you can also visit the original URL.
The file type is application/pdf.
Within the combinatorial scheduling community, there has been an increasing interest in modelling and solving scheduling problems in dynamic environments. ...
This paper provides a context for investigating the integration of queueing theory and scheduling approaches with the goal of more effectively solving scheduling problems arising in dynamic environments ...
Acknowledgements The authors would like to thank the reviewers for their comments, which helped improve the paper. ...
doi:10.1016/j.sorms.2014.09.001
fatcat:q3qodawkwnawneatlnzm4depcm
Rescheduling frequency in an FMS with uncertain processing times and unreliable machines
1999
Journal of manufacturing systems
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 paper studies the scheduling/rescheduling problem in a multi-resource FMS environment. ...
Several reactive scheduling policies are proposed to address the effects of machine breakdowns and processing time variations. ...
Because the FMS scheduling problem requires global coordination of various resources in the system, the problem is studied under various experimental conditions: varying machine and AGV load levels, machine ...
doi:10.1016/s0278-6125(00)86630-3
fatcat:nkn6hjid5vcf7df3hok5egbdga
« Previous
Showing results 1 — 15 out of 20,131 results