Kenneth R. Baker

According to our database1, Kenneth R. Baker authored at least 43 papers between 1975 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.



In proceedings 
PhD thesis 




Propagation Modeling Through Foliage in a Coniferous Forest at 28 GHz.
IEEE Wirel. Commun. Lett., 2019

Using LZMA Compression for Spectrum Sensing with SDR Samples.
Proceedings of the 9th IEEE Annual Ubiquitous Computing, 2018

Minimizing flowtime for paired tasks.
Eur. J. Oper. Res., 2017

Puzzle - Brushing the Court Lines Optimally.
INFORMS Trans. Education, 2016

Trading off due-date tightness and job tardiness in a basic scheduling model.
J. Sched., 2015

Systems For Spectrum Forensics.
Proceedings of the 2nd International Workshop on Hot Topics in Wireless, 2015

Downlink Performance Analysis for a Generalized Shotgun Cellular System.
IEEE Trans. Wireless Communications, 2014

Minimizing earliness and tardiness costs in stochastic scheduling.
Eur. J. Oper. Res., 2014

Setting optimal due dates in a basic safe-scheduling model.
Comput. Oper. Res., 2014

Computational results for the flowshop tardiness problem.
Comput. Ind. Eng., 2013

Stochastic Ordering Based Carrier-to-Interference Ratio Analysis for the Shotgun Cellular Systems.
IEEE Wirel. Commun. Lett., 2012

Modeling activity times by the Parkinson distribution with a lognormal core: Theory and validation.
Eur. J. Oper. Res., 2012

Heuristic solution methods for the stochastic flow shop problem.
Eur. J. Oper. Res., 2012

Comparison of LTE Performance Indicators and Throughput in Indoor and Outdoor Scenarios at 700 MHz.
Proceedings of the 76th IEEE Vehicular Technology Conference, 2012

Three heuristic procedures for the stochastic, two-machine flow shop problem.
J. Sched., 2011

Multi-Tier Network Performance Analysis Using a Shotgun Cellular System.
Proceedings of the Global Communications Conference, 2011

Generalized Carrier to Interference Ratio Analysis for the Shotgun Cellular System
CoRR, 2010

Solving the single-machine sequencing problem using integer programming.
Comput. Ind. Eng., 2010

Modeling of Interference from Cooperative Cognitive Radios for Low Power Primary Users.
Proceedings of the Global Communications Conference, 2010

An Optimal Contact Model for Maximizing Online Panel Response Rates.
Manag. Sci., 2009

Errors in Operational Spreadsheets.
J. Organ. End User Comput., 2009

Safe scheduling: Setting due dates in single-machine problems.
Eur. J. Oper. Res., 2009

Impact of errors in operational spreadsheets.
Decis. Support Syst., 2009

Errors in Operational Spreadsheets: A Review of the State of the Art.
Proceedings of the 42st Hawaii International International Conference on Systems Science (HICSS-42 2009), 2009

Minimizing the number of tardy jobs with stochastically-ordered processing times.
J. Sched., 2008

An auditing protocol for spreadsheet models.
Inf. Manag., 2008

A critical review of the literature on spreadsheet errors.
Decis. Support Syst., 2008

Comparison of Characteristics and Practices amongst Spreadsheet Users with Different Levels of Experience
CoRR, 2008

Using a Hybrid of Silhouette and Range Templates for Real-time pose Estimation.
Proceedings of the 2004 IEEE International Conference on Robotics and Automation, 2004

Pose Estimation for Servicing of Orbital Replacement Units in a Cluttered Environment.
Proceedings of the 2004 IEEE International Conference on Robotics and Automation, 2004

A Multiple-Criterion Model for Machine Scheduling.
J. Sched., 2003

Optimal block design models for course timetabling.
Oper. Res. Lett., 2002

Minimizing maximum lateness with job families.
Eur. J. Oper. Res., 2000

On the WMC density as an inverse Gaussian probability density.
IEEE Trans. Communications, 1996

Scheduling Groups of Jobs on a Single Machine.
Oper. Res., 1995

Lot streaming in the two-machine flow shop with setup times.
Annals OR, 1995

Basic Techniques for Lot Streaming.
Oper. Res., 1993

Chapter 11 Requirements planning.
Proceedings of the Logistics of Production and Inventory, 1993

Sequencing with Earliness and Tardiness Penalties: A Review.
Oper. Res., 1990

Dynamic Programming Solution of Sequencing Problems with Precedence Constraints.
Oper. Res., 1978

Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks.
Oper. Res., 1978

Technical Note - An Elimination Method for the Flow-Shop Problem.
Oper. Res., 1975

A Comparative Study of Flow-Shop Algorithms.
Oper. Res., 1975