The following pages link to Charles E. Wells (Q256696):
Displaying 28 items.
- Bounds on uptime distribution based on aging for systems with finite lifetimes (Q256697) (← links)
- CON due-date determination and sequencing (Q908841) (← links)
- Scheduling about a common due date with earliness and tardiness penalties (Q908845) (← links)
- The discrete time-cost tradeoff problem revisited (Q1129886) (← links)
- Some clarifications on the bicriteria scheduling of unit execution time jobs on a single machine (Q1184462) (← links)
- On the minimization of the weighted number of tardy jobs with random processing times and deadline (Q1186923) (← links)
- Scheduling to minimize weighted earliness and tardiness about a common due-date (Q1186924) (← links)
- Optimal due-date assignment and sequencing (Q1197665) (← links)
- Optimal retrieval strategies for carousel conveyors (Q1206145) (← links)
- On the general solution for a class of early/tardy problems (Q1207204) (← links)
- Delivery time quotation and order processing with forbidden early shipments (Q1260740) (← links)
- Job selection and sequencing on a single machine in a random environment (Q1310027) (← links)
- Reliability analysis of a single warm-standby system subject to repairable and nonrepairable failures (Q2256217) (← links)
- An examination of job interchange relationships and induction-based proofs in single machine scheduling (Q2399322) (← links)
- (Q3223607) (← links)
- On the use of integral transform methods: a new perspective (Q3347070) (← links)
- Reliability Characteristics of a Markov System With a Mission of Random Duration (Q3687473) (← links)
- On the Replenishment of Repair Kit Inventories for Systems with Life Distributions of Phase Type (Q3724063) (← links)
- Reliability Measures for a Regenerative System Viewed Over a Random Horizon (Q3760282) (← links)
- Replacement vs. repair of failed components for a system with a random lifetime (Q3790431) (← links)
- Decentralized decision‐making involving multiple criteria: a multiple knapsack formulation (Q3813622) (← links)
- Statistical procedures for estimating branch flows and total network flow (Q3825987) (← links)
- On the solution of a stochastic bottleneck assignment problem and its variations (Q3989987) (← links)
- On the Minimization of Completion Time Variance with a Bicriteria Extension (Q4032593) (← links)
- Due-date assignment and early/tardy scheduling on identical parallel machines (Q4279269) (← links)
- Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks (Q4367255) (← links)
- Note—A Note on the Minimization of Mean Squared Deviation of Completion Times About a Common Due Date (Q4733656) (← links)
- Determining optimal redundancy for systems with random lifetimes (Q5753328) (← links)