Charles E. Wells

Orcid: 0000-0001-6347-8165

According to our database1, Charles E. Wells authored at least 14 papers between 1989 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2017
An examination of job interchange relationships and induction-based proofs in single machine scheduling.
Ann. Oper. Res., 2017

2015
Bounds on uptime distribution based on aging for systems with finite lifetimes.
Ann. Oper. Res., 2015

2014
Reliability analysis of a single warm-standby system subject to repairable and nonrepairable failures.
Eur. J. Oper. Res., 2014

1997
Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks.
Oper. Res., 1997

1995
Cooperative distributed problem solving: an investigation in the domain of jobshop scheduling.
Proceedings of the 28th Annual Hawaii International Conference on System Sciences (HICSS-28), 1995

1993
Delivery time quotation and order processing with forbidden early shipments.
Comput. Oper. Res., 1993

On the general solution for a class of early/tardy problems.
Comput. Oper. Res., 1993

1992
On the Minimization of Completion Time Variance with a Bicriteria Extension.
Oper. Res., 1992

1991
Some clarifications on the bicriteria scheduling of unit execution time jobs on a single machine.
Comput. Oper. Res., 1991

Scheduling to minimize weighted earliness and tardiness about a common due-date.
Comput. Oper. Res., 1991

On the minimization of the weighted number of tardy jobs with random processing times and deadline.
Comput. Oper. Res., 1991

1990
CON due-date determination and sequencing.
Comput. Oper. Res., 1990

Scheduling about a common due date with earliness and tardiness penalties.
Comput. Oper. Res., 1990

1989
Statistical procedures for estimating branch flows and total network flow.
Networks, 1989


  Loading...