Open Access. Powered by Scholars. Published by Universities.®
Operations Research, Systems Engineering and Industrial Engineering Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Keyword
- Publication
-
- Research Collection School Of Computing and Information Systems (6)
- Business and Information Technology Faculty Research & Creative Works (1)
- Department of Industrial and Management Systems Engineering: Faculty Publications (1)
- Industrial and Management Systems Engineering: Instructional Materials (1)
- Mechanical and Aerospace Engineering - All Scholarship (1)
Articles 1 - 11 of 11
Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering
Multi-Period Combinatorial Auction Mechanism For Distributed Resource Allocation And Scheduling, Hoong Chuin Lau, Shih-Fen Cheng, Thin Yin Leong, Jong Han Park, Zhengyi Zhao
Multi-Period Combinatorial Auction Mechanism For Distributed Resource Allocation And Scheduling, Hoong Chuin Lau, Shih-Fen Cheng, Thin Yin Leong, Jong Han Park, Zhengyi Zhao
Research Collection School Of Computing and Information Systems
We consider the problem of resource allocation and scheduling where information and decisions are decentralized, and our goal is to propose a market mechanism that allows resources from a central resource pool to be allocated to distributed decision makers (agents) that seek to optimize their respective scheduling goals. We propose a generic combinatorial auction mechanism that allows agents to competitively bid for the resources needed in a multi-period setting, regardless of the respective scheduling problem faced by the agent, and show how agents can design optimal bidding strategies to respond to price adjustment strategies from the auctioneer. We apply our …
Designing The Market Game For A Commodity Trading Simulation, Shih-Fen Cheng
Designing The Market Game For A Commodity Trading Simulation, Shih-Fen Cheng
Research Collection School Of Computing and Information Systems
In this paper, we propose to design a market game that (a) can be used in modeling and studying commodity trading scenarios, and (b) can be used in capturing human traders' behaviors. Specifically, we demonstrate the usefulness of this commodity trading game in a single-commodity futures trading scenario. A pilot experiment was run with a mixture of human traders and an autonomous agent that emulates the aggregatedmarket condition, with the assumption that this autonomous agent would hint each of its action through a public announcement. We show that the information collected from this simulation can be used to extract the …
The Price Of Stability In Selfish Scheduling Games, Lucas Agussurja, Hoong Chuin Lau
The Price Of Stability In Selfish Scheduling Games, Lucas Agussurja, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Game theory has gained popularity as an approach to analysing and understanding distributed systems with selfinterested agents. Central to game theory is the concept of Nash equilibrium as a stable state (solution) of the system, which comes with a price - the loss in efficiency. The quantification of the efficiency loss is one of the main research concerns. In this paper, we study the quality and computational characteristic of the best Nash equilibrium in two selfish scheduling models: the congestion model and the sequencing model. In particular, we present the following results: (1) In the congestion model: first, the best …
Semester Project For Engineering Management, Paul Savory
Semester Project For Engineering Management, Paul Savory
Industrial and Management Systems Engineering: Instructional Materials
This is the semester-project for my IMSE 405/805 course on Engineering Management at the University of Nebraska-Lincoln. This team-based project required students to develop an operational plan (facility layout, required staffing, company operating policies, company benefits program) for a specified product.
Robust Local Search And Its Application To Generating Robust Schedules, Hoong Chuin Lau, Fei Xiao, Thomas Ou
Robust Local Search And Its Application To Generating Robust Schedules, Hoong Chuin Lau, Fei Xiao, Thomas Ou
Research Collection School Of Computing and Information Systems
In this paper, we propose an extended local search framework to solve combinatorial optimization problems with data uncertainty. Our approach represents a major departure from scenario-based or stochastic programming approaches often used to tackle uncertainty. Given a value 0 < ? 1, we are interested to know what the robust objective value is, i.e. the optimal value if we allow an chance of not meeting it, assuming that certain data values are defined on bounded random variables. We show how a standard local search or metaheuristic routine can be extended to efficiently construct a decision rule with such guarantee, albeit heuristically. We demonstrate its practical applicability on the Resource Constrained Project Scheduling Problem with minimal and maximal time lags (RCPSP/max) taking into consideration activity duration uncertainty. Experiments show that, partial order schedules can be constructed that are robust in our sense without the need for a large planned horizon (due date), which improves upon the work proposed by Policella et al. 2004.
Using Reconstructability Analysis For Input Variable Reduction: A Business Example, Stephen Shervais, Martin Zwick
Using Reconstructability Analysis For Input Variable Reduction: A Business Example, Stephen Shervais, Martin Zwick
Systems Science Faculty Publications and Presentations
We demonstrate the use of reconstructability analysis (RA) on the UCI Australian Credit dataset to reduce the number of input variables for two different analysis tools. Using 14 variables, an artificial neural net (NN) is able to predict whether or not credit was granted, with a 79.1% success rate. RA preprocessing allows us to reduce the number of independent variables from 14 to two different sets of three, which have success rates of 77.2% and 76.9% respectively. The difference between these rates and that of the 14-variable NN is not statistically significant. The three-variable rulesets given by RA achieve success …
Generating Job Schedules For Vessel Operations In A Container Terminal, Thin Yin Leong, Hoong Chuin Lau
Generating Job Schedules For Vessel Operations In A Container Terminal, Thin Yin Leong, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
No abstract provided.
Engineering Management And Industrial Engineering: Similarities And Differences, Cassandra C. Elrod, Ashley Rasnic, William Daughton
Engineering Management And Industrial Engineering: Similarities And Differences, Cassandra C. Elrod, Ashley Rasnic, William Daughton
Business and Information Technology Faculty Research & Creative Works
Engineering Management is a broad and diverse field of engineering, thereby making it difficult to define exactly what the degree encompasses. At the same time, the somewhat related degree of Industrial Engineering is better understood. Some universities offer a Bachelor of Science degree in Engineering Management with an emphasis in Industrial Engineering, while others offer a Bachelor of Science degree in Industrial Engineering with an emphasis in Engineering Management. In today's world of competitive academia, many wonder if these degree fields are similar enough to be used interchangeably or if there is a distinct difference separating the two degrees, making …
2007 Survey Of Summer Sessions Students At The University Of Nebraska-Lincoln, Paul Savory
2007 Survey Of Summer Sessions Students At The University Of Nebraska-Lincoln, Paul Savory
Department of Industrial and Management Systems Engineering: Faculty Publications
During Summer 2007, UNL Summer Sessions (FlexEd) surveyed summer students to learn about their experience in taking a summer course(s). The survey results will offer confirmation of what we are doing well and will provide guidance on areas of improvement and better strategies for marketing UNL summer opportunities. A total of 227 students completed the survey. Fifteen summer classes were selected to complete a paper-based or electronic version of the survey. The classes were from three different summer sessions and used different delivery mechanisms (on-campus, studio, distance education).
Enterprise Resource Planning (Erp): A Review Of The Literature, Young Moon
Enterprise Resource Planning (Erp): A Review Of The Literature, Young Moon
Mechanical and Aerospace Engineering - All Scholarship
This article is a review of work published in various journals on the topics of Enterprise Resource Planning (ERP) between January 2000 and May 2006. A total of 313 articles from 79 journals are reviewed. The article intends to serve three goals. First, it will be useful to researchers who are interested in understanding what kinds of questions have been addressed in the area of ERP. Second, the article will be a useful resource for searching for research topics. Third, it will serve as a comprehensive bibliography of the articles published during the period. The literature is analysed under six …
Towards Efficient Computation Of Quality Bounded Solutions In Pomdps: Expected Value Approximation And Dynamic Disjunctive Beliefs, Pradeep Reddy Varakantham, Rajiv Maheswaran, Tapana Gupta, Milind Tambe
Towards Efficient Computation Of Quality Bounded Solutions In Pomdps: Expected Value Approximation And Dynamic Disjunctive Beliefs, Pradeep Reddy Varakantham, Rajiv Maheswaran, Tapana Gupta, Milind Tambe
Research Collection School Of Computing and Information Systems
While POMDPs (partially observable markov decision problems) are a popular computational model with wide-ranging applications, the computational cost for optimal policy generation is prohibitive. Researchers are investigating ever-more efficient algorithms, yet many applications demand such algorithms bound any loss in policy quality when chasing efficiency. To address this challenge, we present two new techniques. The first approximates in the value space to obtain solutions efficiently for a pre-specified error bound. Unlike existing techniques, our technique guarantees the resulting policy will meet this bound. Furthermore, it does not require costly computations to determine the quality loss of the policy. Our second …