Journal ArticleDOI
Single‐machine scheduling subject to stochastic breakdowns
TLDR
Several examples of one‐machine problems in which the minimization of expected cost subject to stochastic breakdowns of the machine can be successfully attacked analytically are provided.Abstract:
We provide several examples of one-machine problems in which the minimization of expected cost subject to stochastic breakdowns of the machine can be successfully attacked analytically. In particular for the weighted flow-time model, we derive strong bounds on the difference between the optimal static policy and the WSPT policy and discuss an example in which the WSPT policy is not optimal.read more
Citations
More filters
Sequencing and scheduling: algorithms and complexity
TL;DR: This survey focuses on the area of deterministic machine scheduling, and reviews complexity results and optimization and approximation algorithms for problems involving a single machine, parallel machines, open shops, flow shops and job shops.
Book ChapterDOI
Chapter 9 Sequencing and scheduling: Algorithms and complexity
TL;DR: Different types of sequencing and scheduling problems are discussed, and different types of algorithms and the concepts of complexity theory are described.
Journal ArticleDOI
Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints
Hamid Allaoui,Abdelhakim Artiba +1 more
TL;DR: This paper deals with the hybrid flow shop scheduling problem under maintenance constraints to optimize several objectives based on flow time and due date and shows how to integrate simulation and optimization to tackle this practical problem which is NP-hard on the strong sense.
Journal ArticleDOI
On the Robust Single Machine Scheduling Problem
Jian Yang,Gang Yu +1 more
TL;DR: It is shown that the robust version of the single machine scheduling problem with sum of completion times criterion (SS) is NP-complete even for very restricted cases.
Journal ArticleDOI
Single-machine scheduling with maintenance and repair rate-modifying activities
Chung Yee Lee,Chen-Sin Lin +1 more
TL;DR: The purpose here is to simultaneously sequence jobs and schedule maintenance activity to optimize regular performance measures and study problems with objective functions such as expected makespan, total expected completion time, maximum expected lateness, and expected maximum lateness.
References
More filters
Book
Nonlinear Programming: Theory and Algorithms
TL;DR: The book is a solid reference for professionals as well as a useful text for students in the fields of operations research, management science, industrial engineering, applied mathematics, and also in engineering disciplines that deal with analytical optimization techniques.
Book ChapterDOI
Nonanticipativity and L1-martingales in stochastic optimization problems
TL;DR: In this paper, necessary and sufficient conditions for optimality are derived for multistage stochastic programs under some standard regularity conditions and a condition of non-anticipative feasibility.
Journal ArticleDOI
Bounds, inequalities, and monotonicity properties for some specialized renewal processes'
TL;DR: In this paper, the renewal process with increasing mean residual life and decreasing failure rate interarrival time distributions is investigated, and various two-sided bounds are obtained for the expected number of renewals.
Journal ArticleDOI
A Note on Stochastic Scheduling on a Single Machine Subject to Breakdown and Repair
Michael Pinedo,Elias Rammouz +1 more
TL;DR: This paper considers a single machine and n jobs and is interested in optimal policies that minimize the following objective functions: the weighted sum of the completion times; the weighted number of late jobs having due dates.
Related Papers (5)
A Note on Stochastic Scheduling on a Single Machine Subject to Breakdown and Repair
Michael Pinedo,Elias Rammouz +1 more
Stochastic single machine scheduling with quadratic early-tardy penalties
John Mittenthal,M. Raghavachari +1 more