His scientific interests lie mostly in Operations research, Mathematical optimization, Tardiness, Scheduling and Flow shop scheduling. His Operations research study incorporates themes from Production planning and Simulation. His Mathematical optimization study deals with Algorithm intersecting with Discrete time and continuous time.
His Tardiness research incorporates themes from Due date, Operations management and Job shop. His Scheduling research includes elements of Purchasing, Project management and Batch production. His Flow shop scheduling research is multidisciplinary, relying on both Decomposition method, Rate-monotonic scheduling and Process.
His primary areas of study are Mathematical optimization, Operations research, Scheduling, Flow shop scheduling and Tardiness. His Mathematical optimization study combines topics from a wide range of disciplines, such as Algorithm and Job shop scheduling. While the research belongs to areas of Job shop scheduling, Kenneth R. Baker spends his time largely on the problem of Dynamic priority scheduling, intersecting his research to questions surrounding Distributed computing.
His Operations research course of study focuses on Project management and Purchasing. His Flow shop scheduling research focuses on subjects like Rate-monotonic scheduling, which are linked to Round-robin scheduling. The concepts of his Tardiness study are interwoven with issues in Due date and Operations management.
His main research concerns Mathematical optimization, Flow shop scheduling, Job shop scheduling, Heuristic and Scheduling. His research on Mathematical optimization frequently links to adjacent areas such as Tardiness. His Flow shop scheduling research incorporates elements of Industrial engineering, Heuristic and Operations research.
His study in Operations research is interdisciplinary in nature, drawing from both Decision tree and Field. Kenneth R. Baker focuses mostly in the field of Job shop scheduling, narrowing it down to matters related to Heuristics and, in some cases, Stochastic modelling and Stochastic programming. His Scheduling study integrates concerns from other disciplines, such as Sorting, Asymptotically optimal algorithm and Dynamic priority scheduling.
His primary areas of investigation include Mathematical optimization, End-user computing, Decision support system, User interface and Database. The study incorporates disciplines such as Tardiness and Job shop scheduling in addition to Mathematical optimization. His biological study spans a wide range of topics, including Branch and bound, Change-making problem, Normal distribution, Software and Branch and price.
Kenneth R. Baker has researched Job shop scheduling in several fields, including Stochastic programming, Sorting, Heuristics, Dynamic priority scheduling and Asymptotically optimal algorithm. In his research, Risk analysis is intimately related to Quality, which falls under the overarching field of Decision support system. His Heuristic research integrates issues from Stochastic modelling, Response rate, Customer relationship management, Linear programming and Scheduling.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Sequencing with Earliness and Tardiness Penalties: A Review
Kenneth R. Baker;Gary D. Scudder.
Principles of Sequencing and Scheduling
Kenneth R. Baker;Dan Trietsch.
Sequencing Rules and Due-Date Assignments in a Job Shop
Kenneth R. Baker.
Scheduling groups of jobs on a single machine
Scott Webster;Kenneth R. Baker.
The Effect of Commonality on Safety Stock in a Simple Inventory Model
Kenneth R. Baker;Michael J. Magazine;Henry L. W. Nuttle.
A Multiple-Criterion Model for Machine Scheduling
Kenneth R. Baker;J. Cole Smith.
Workforce Allocation in Cyclical Scheduling Problems: A Survey
Kenneth R. Baker.
AN EXPERIMENTAL STUDY OF THE EFFECTIVENESS OF ROLLING SCHEDULES IN PRODUCTION PLANNING
Kenneth R. Baker.
Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
Linus Schrage;Kenneth R. Baker.
A dynamic priority rule for scheduling against due-dates
Kenneth R. Baker;J.W.M. Bertrand.
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: