Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons™

Open Access. Powered by Scholars. Published by Universities.®

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year
File Type

Articles 6091 - 6120 of 6891

Full-Text Articles in Physical Sciences and Mathematics

Mobile G-Portal Supporting Collaborative Sharing And Learning In Geography Fieldwork: An Empirical Study, Yin-Leng Theng, Kuah-Li Tan, Ee Peng Lim, Jun Zhang, Dion Hoe-Lian Goh, Kalyani Chatterjea, Chew-Hung Chang, Aixin Sun, Han Yu, Nam Hai Dang, Yuanyuan Li, Minh Chanh Vo Jun 2007

Mobile G-Portal Supporting Collaborative Sharing And Learning In Geography Fieldwork: An Empirical Study, Yin-Leng Theng, Kuah-Li Tan, Ee Peng Lim, Jun Zhang, Dion Hoe-Lian Goh, Kalyani Chatterjea, Chew-Hung Chang, Aixin Sun, Han Yu, Nam Hai Dang, Yuanyuan Li, Minh Chanh Vo

Research Collection School Of Computing and Information Systems

Integrated with G-Portal, a Web-based geospatial digital library of geography resources, this paper describes the implementation of Mobile G-Portal, a group of mobile devices as learning assistant tools supporting collaborative sharing and learning for geography fieldwork. Based on a modified Technology Acceptance Model and a Task-Technology Fit model, an initial study with Mobile G-Portal was conducted involving 39 students in a local secondary school. The findings suggested positive indication of acceptance of Mobile G-Portal for geography fieldwork. The paper concludes with a discussion on technological challenges, recommendations for refinement of Mobile G-Portal, and design implications in general for digital libraries …

Go to article

Innovation Engine, Arcot Desai Narasimhalu Jun 2007

Innovation Engine, Arcot Desai Narasimhalu

Research Collection School Of Computing and Information Systems

This paper describes a meta-model for innovation using an automobile engine as a metaphor. This innovation meta-model is used to manage a collection of innovation models. We develop an algorithm to identify innovations with potential for success using this meta-model. This meta-model can be used by corporations and individuals to identify plausible innovations at any given point in time.

Go to article

A Time-And-Value Centric Provenance Model And Architecture For Medical Event Streams, Marion Bllount, John Davis, Archan Misra, Daby Sow, Min Wang Jun 2007

A Time-And-Value Centric Provenance Model And Architecture For Medical Event Streams, Marion Bllount, John Davis, Archan Misra, Daby Sow, Min Wang

Research Collection School Of Computing and Information Systems

Provenance becomes a critical requirement for healthcare IT infrastructures, especially when pervasive biomedical sensors act as a source of raw medical streams for large-scale, automated clinical decision support systems. Medical and legal requirements will make it obligatory for such systems to answer queries regarding the underlying data samples from which output alerts are derived, the IDs of the processing components used and the privileges of the individuals and software components accessing the medical data. Unfortunately, existing models of either annotation or process based provenance are designed for transaction-oriented systems and do not satisfy the unique requirements for systems processing high-volume, …

Go to article

Continuous Nearest Neighbor Queries Over Sliding Windows, Kyriakos Mouratidis, Dimitris Papadias Jun 2007

Continuous Nearest Neighbor Queries Over Sliding Windows, Kyriakos Mouratidis, Dimitris Papadias

Research Collection School Of Computing and Information Systems

Recent research has focused on continuous monitoring of nearest neighbors (NN) in highly dynamic scenarios, where the queries and the data objects move frequently and arbitrarily. All existing methods, however, assume the Euclidean distance metric. In this paper we study k-NN monitoring in road networks, where the distance between a query and a data object is determined by the length of the shortest path connecting them. We propose two methods that can handle arbitrary object and query moving patterns, as well as fluctuations of edge weights. The first one maintains the query results by processing only updates that may invalidate …

Go to article

Maximizing Broadcast And Multicast Traffic Load Through Link-Rate Diversity In Wireless Mesh Networks, Chun Tung Chou, Bao Hua Liu, Archan Misra Jun 2007

Maximizing Broadcast And Multicast Traffic Load Through Link-Rate Diversity In Wireless Mesh Networks, Chun Tung Chou, Bao Hua Liu, Archan Misra

Research Collection School Of Computing and Information Systems

This paper studies some of the fundamental challenges and opportunities associated with the network-layer broadcast and multicast in a multihop multirate wireless mesh network (WMN). In particular, we focus on exploiting the ability of nodes to perform link-layer broadcasts at different rates (with correspondingly different coverage areas). We first show how, in the broadcast wireless medium, the available capacity at a mesh node for a multicast transmission is not just a function of the aggregate pre-existing traffic load of other interfering nodes, but intricately coupled to the actual (sender, receiver) set and the link-layer rate of each individual transmission. We …

Go to article

Editors' Introduction To Regular Research Section, Jae Kyu Lee, Patrick Y. K. Chau, Robert J. Kauffman, Norman M. Sadeh Jun 2007

Editors' Introduction To Regular Research Section, Jae Kyu Lee, Patrick Y. K. Chau, Robert J. Kauffman, Norman M. Sadeh

Research Collection School Of Computing and Information Systems

The second section of this issue consists of four regular submissions.In “A New Mobile Payment Scheme for Roaming Services”, Ren-Junn Hwang, Sheng-Hua Shiau and Ding-Far Jan present a new mobile payment scheme that supports anonymity while allowing consumers to roam outside of their home operator’s network.Vasudeva Akula and Daniel A. Menascé’s article on “Two-level Workload Characterization of Online Auctions” analyzes the workload of an online auction site. The analysis reveals the presence of heavy tailed distributions and looks at bidding activity during the closing minutes of auctions. The article suggests that results from this analysis could be used to devise …

Go to article

Instance Weighting For Domain Adaptation In Nlp, Jing Jiang, Chengxiang Zhai Jun 2007

Instance Weighting For Domain Adaptation In Nlp, Jing Jiang, Chengxiang Zhai

Research Collection School Of Computing and Information Systems

Domain adaptation is an important problem in natural language processing (NLP) due to the lack of labeled data in novel domains. In this paper, we study the domain adaptation problem from the instance weighting per- spective. We formally analyze and charac- terize the domain adaptation problem from a distributional view, and show that there are two distinct needs for adaptation, cor- responding to the different distributions of instances and classification functions in the source and the target domains. We then propose a general instance weighting frame- work for domain adaptation. Our empir- ical results on three NLP tasks show that …

Go to article

Designing An Experimental Gaming Platform For Trading Grid Resources, Danny Oh, Shih-Fen Cheng, Dan Ma, Ravi Bapna Jun 2007

Designing An Experimental Gaming Platform For Trading Grid Resources, Danny Oh, Shih-Fen Cheng, Dan Ma, Ravi Bapna

Research Collection School Of Computing and Information Systems

This paper describes our current work in designing an experimental gaming platform for simulating the trading of grid resources. The open platform allows researchers in grid economics to experiment with different market structures and pricing models. We would be using a design science approach in the implementation. Key design considerations and an overview of the functional design of the platform are presented and discussed.

Go to article

Teaching "Global Project Management" With Distributed Team Projects, Randy Weinberg, Benjamin Gan Jun 2007

Teaching "Global Project Management" With Distributed Team Projects, Randy Weinberg, Benjamin Gan

Research Collection School Of Computing and Information Systems

The education of rising professionals must keep pace with changing forces of globalization and the realities of distributed work. Students who understand the basics of global project management, teamwork and collaboration are likely to find themselves at a competitive advantage over those who do not. This article describes the experiences in an undergraduate course called Global Project Management offered concurrently at two universities, one in the U.S. and one in Singapore, and incorporating collaborative student projects.

Go to article

Intelligence Through Interaction: Towards A Unified Theory For Learning, Ah-Hwee Tan, Gail A. Carpenter, Stephen Grossberg Jun 2007

Intelligence Through Interaction: Towards A Unified Theory For Learning, Ah-Hwee Tan, Gail A. Carpenter, Stephen Grossberg

Research Collection School Of Computing and Information Systems

Machine learning, a cornerstone of intelligent systems, has typically been studied in the context of specific tasks, including clustering (unsupervised learning), classification (supervised learning), and control (reinforcement learning). This paper presents a learning architecture within which a universal adaptation mechanism unifies a rich set of traditionally distinct learning paradigms, including learning by matching, learning by association, learning by instruction, and learning by reinforcement. In accordance with the notion of embodied intelligence, such a learning theory provides a computational account of how an autonomous agent may acquire the knowledge of its environment in a real-time, incremental, and continuous manner. Through a …

Go to article

The Multi-Agent Data Collection In Hla-Based Simulation System, Heng-Jie Song, Zhi-Qi Shen, Chunyan Miao, Ah-Hwee Tan, Guo-Peng Zhao Jun 2007

The Multi-Agent Data Collection In Hla-Based Simulation System, Heng-Jie Song, Zhi-Qi Shen, Chunyan Miao, Ah-Hwee Tan, Guo-Peng Zhao

Research Collection School Of Computing and Information Systems

The High Level Architecture (HLA) for distributed simulation was proposed by the Defense Modeling and Simulation Office of the Department of Defense (DOD) in order to support interoperability among simulations as well as reuse of simulation models. One aspect of reusability is to collect and analyze data generated in simulation exercises, including a record of events that occur during the execution, and the states of simulation objects. In order to improve the performance of existing data collection mechanisms in the HLA simulation system, the paper proposes a multi-agent data collection system. The proposed approach adopts the hierarchical data management/organization mechanism …

Go to article

A Hybrid Of Plot-Based And Character-Based Interactive Storytelling, Yundong Cai, Chunyan Miao, Ah-Hwee Tan, Zhiqi Shen Jun 2007

A Hybrid Of Plot-Based And Character-Based Interactive Storytelling, Yundong Cai, Chunyan Miao, Ah-Hwee Tan, Zhiqi Shen

Research Collection School Of Computing and Information Systems

Interactive storytelling in the virtual environment attracts a lot of research interests in recent years. Story plot and character are two most important elements of a story. Based on these two elements, currently there are two research directions: plot-based and character-based interactive storytelling. However, plot-based approach lacks the refinement of character behaviors as character-based approach. On the other side, character-based approach does not follow a well organized story plot so that the moral of the story might be distorted. Therefore, there is a need to develop an integrated framework to achieve the balance between conveying story moral and enhancing the …

Go to article

Time Capsule Signature: Efficient And Provably Secure Constructions, Bessie C. Hu, Duncan S. Wong, Qiong Huang, Guomin Yang, Xiaotie Deng Jun 2007

Time Capsule Signature: Efficient And Provably Secure Constructions, Bessie C. Hu, Duncan S. Wong, Qiong Huang, Guomin Yang, Xiaotie Deng

Research Collection School Of Computing and Information Systems

Time Capsule Signature, first formalized by Dodis and Yum in Financial Cryptography 2005, is a digital signature scheme which allows a signature to bear a (future) time t so that the signature will only be valid at time t or later, when a trusted third party called time server releases time-dependent information for checking the validity of a time capsule signature. Also, the actual signer of a time capsule signature has the privilege to make the signature valid before time t.In this paper, we provide a new security model of time capsule signature such that time server is not required …

Go to article

A More Natural Way To Construct Identity-Based Identification Schemes, Guomin Yang, Jing Chen, Duncan S. Wong, Xiaotie Deng, Dongsheng Wang Jun 2007

A More Natural Way To Construct Identity-Based Identification Schemes, Guomin Yang, Jing Chen, Duncan S. Wong, Xiaotie Deng, Dongsheng Wang

Research Collection School Of Computing and Information Systems

Constructing identification schemes is one of the fundamental problems in cryptography, and is very useful in practice. An identity-based identification (IBI) scheme allows a prover to identify itself to a public verifier who knows only the claimed identity of the prover and some common information. In this paper, we propose a simple and efficient framework for constructing IBI schemes. Unlike some related framework which constructs IBI schemes from some standard identification schemes, our framework is based on some more fundamental assumptions on intractable problems. Depending on the features of the underlying intractable problems presumed in our framework, we can derive …

Go to article

Are Radio Sources And Gamma Ray Bursts Luminal Booms?, Manoj Thulasidas Jun 2007

Are Radio Sources And Gamma Ray Bursts Luminal Booms?, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

The softening of a Gamma Ray Burst (GRB) afterglow bears remarkable similarities to the frequency evolution in a sonic boom. Atthe front end of the sonic boom cone, the frequency is infinite, much like a GRB. Inside the cone, the frequencyrapidly decreases to infrasonic ranges and the sound source appears at two places at the same time,mimicking the double-lobed radio sources. Although a “luminal” boom violates the Lorentz invarianceand is therefore forbidden, it is tempting to work out the details and compare them with existing data. This temptation is further enhanced by the observed superluminality in the celestial objects associated …

Go to article

Simplifying Cyber Foraging For Mobile Devices, Rajesh Krishna Balan, Darren Gergle, Mahadev Satyanarayanan, James Herbsleb Jun 2007

Simplifying Cyber Foraging For Mobile Devices, Rajesh Krishna Balan, Darren Gergle, Mahadev Satyanarayanan, James Herbsleb

Research Collection School Of Computing and Information Systems

Cyber foraging is the transient and opportunistic use of compute servers by mobile devices. The short market life of such devices makes rapid modification of applications for remote execution an important problem. We describe a solution that combines a "little language" for cyber foraging with an adaptive runtime system. We report results from a user study showing that even novice developers are able to successfully modify large, unfamiliar applications in just a few hours. We also show that the quality of novice-modified and expert-modified applications are comparable in most cases.

Go to article

Enhancing The Performance Of Semi-Supervised Classification Algorithms With Bridging, Jason Yuk Hin Chan, Josiah Poon, Irena Koprinska May 2007

Enhancing The Performance Of Semi-Supervised Classification Algorithms With Bridging, Jason Yuk Hin Chan, Josiah Poon, Irena Koprinska

Research Collection School Of Computing and Information Systems

Traditional supervised classification algorithms require a large number of labelled examples to perform accurately. Semi-supervised classification algorithms attempt to overcome this major limitation by also using unlabelled examples. Unlabelled examples have also been used to improve nearest neighbour text classification in a method called bridging. In this paper, we propose the use of bridging in a semi-supervised setting. We introduce a new bridging algorithm that can be used as a base classifier in any supervised approach such as co-training or selflearning. We empirically show that classification performance increases by improving the semi-supervised algorithm’s ability to correctly assign labels to previouslyunlabelled …

Go to article

Analysis Of Topological Characteristics Of Huge Online Social Networking Services, Yong-Yeol Ahn, Seungyeop Han, Haewoon Kwak, Sue Moon, Hawoong Jeong May 2007

Analysis Of Topological Characteristics Of Huge Online Social Networking Services, Yong-Yeol Ahn, Seungyeop Han, Haewoon Kwak, Sue Moon, Hawoong Jeong

Research Collection School Of Computing and Information Systems

Social networking services are a fast-growing business in the Internet. However, it is unknown if online relationships and their growth patterns are the same as in real-life social networks. In this paper, we compare the structures of three online social networking services: Cyworld, MySpace, and orkut, each with more than 10 million users, respectively. We have access to complete data of Cyworld's ilchon (friend) relationships and analyze its degree distribution, clustering property, degree correlation, and evolution over time. We also use Cyworld data to evaluate the validity of snowball sampling method, which we use to crawl and obtain partial network …

Go to article

Deckard: Scalable And Accurate Tree-Based Detection Of Code Clones, Lingxiao Jiang, Ghassan Misherghi, Zhendong Su, Stephane Glondu May 2007

Deckard: Scalable And Accurate Tree-Based Detection Of Code Clones, Lingxiao Jiang, Ghassan Misherghi, Zhendong Su, Stephane Glondu

Research Collection School Of Computing and Information Systems

Detecting code clones has many software engineering applications. Existing approaches either do not scale to large code bases or are not robust against minor code modifications. In this paper, we present an efficient algorithm for identifying similar subtrees and apply it to tree representations of source code. Our algorithm is based on a novel characterization of subtrees with numerical vectors in the Euclidean Rn and an efficient algorithm to cluster these vectors w.r.t. the Euclidean distance metric. Subtrees with vectors in one cluster are considered similar. We have implemented our tree similarity algorithm as a clone detection tool called DECKARD …

Go to article

Modeling Architectural Strategy Using Design Structure Networks, C. Jason Woodard May 2007

Modeling Architectural Strategy Using Design Structure Networks, C. Jason Woodard

Research Collection School Of Computing and Information Systems

System architects face the formidable task of purposefully shaping an evolving space of complex designs. Their task s further complicated when they lack full control of the design process, and therefore must anticipate the behavior of other stakeholders, including the designers of component products and competing systems. This paper presents a conceptual tool called a design structure network (DSN) to help architects and design scientists reason effectively about these situations. A DSN is a graphical representation of a system’s design space. DSNs improve on existing representation schemes by providing a compact and intuitive way to express design options—the ability to …

Go to article

Achieving End-To-End Authentication In Intermediary-Enabled Multimedia Delivery Systems, Robert H. Deng, Yanjiang Yang May 2007

Achieving End-To-End Authentication In Intermediary-Enabled Multimedia Delivery Systems, Robert H. Deng, Yanjiang Yang

Research Collection School Of Computing and Information Systems

Considerable research and experiment results in recent years have shown that the server-proxy-user architecture represents an efficient and scalable new paradigm for multimedia content delivery. However, not much effort has been spent on the security issues in such systems. In this paper, we study data authentication in multimedia content delivery, and in particular, we focus on achieving end-to-end authentication from the multimedia server to end users in the server-proxy-user architecture where intermediary proxies transcode multimedia content dynamically. We present a formal model for the end-to-end authentication problem, and propose a basic construction for generic data modality and prove its security. …

Go to article

Forgery Attack To An Asymptotically Optimal Traitor Tracing Scheme, Yongdong Wu, Feng Bao, Robert H. Deng May 2007

Forgery Attack To An Asymptotically Optimal Traitor Tracing Scheme, Yongdong Wu, Feng Bao, Robert H. Deng

Research Collection School Of Computing and Information Systems

In this paper, we present a forgery attack to a black-box traitor tracing scheme [2] called as CPP scheme. CPP scheme has efficient transmission rate and allows the tracer to identify a traitor with just one invalid ciphertext. Since the original CPP scheme is vulnerable to the multi-key attack, we improved CPP to thwart the attack. However, CPP is vulnerable to a fatal forgery attack. In the forgery attack, two traitors can collude to forge all valid decryption keys. The forged keys appear as perfect genuine keys, can decrypt all protected content, but are untraceable by the tracer. Fortunately, we …

Go to article

Learning To Classify E-Mail, Irena Koprinska, Josiah Poon, James Clark, Jason Yuk Hin Chan May 2007

Learning To Classify E-Mail, Irena Koprinska, Josiah Poon, James Clark, Jason Yuk Hin Chan

Research Collection School Of Computing and Information Systems

In this paper we study supervised and semi-supervised classification of e-mails. We consider two tasks: filing e-mails into folders and spam e-mail filtering. Firstly, in a supervised learning setting, we investigate the use of random forest for automatic e-mail filing into folders and spam e-mail filtering. We show that random forest is a good choice for these tasks as it runs fast on large and high dimensional databases, is easy to tune and is highly accurate, outperforming popular algorithms such as decision trees, support vector machines and naive Bayes. We introduce a new accurate feature selector with linear time complexity. …

Go to article

Gprune: A Constraint Pushing Framework For Graph Pattern Mining, Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu May 2007

Gprune: A Constraint Pushing Framework For Graph Pattern Mining, Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu

Research Collection School Of Computing and Information Systems

In graph mining applications, there has been an increasingly strong urge for imposing user-specified constraints on the mining results. However, unlike most traditional itemset constraints, structural constraints, such as density and diameter of a graph, are very hard to be pushed deep into the mining process. In this paper, we give the first comprehensive study on the pruning properties of both traditional and structural constraints aiming to reduce not only the pattern search space but the data search space as well. A new general framework, called gPrune, is proposed to incorporate all the constraints in such a way that they …

Go to article

A Multimodal And Multilevel Ranking Framework For Content-Based Video Retrieval, Steven C. H. Hoi, Michael R. Lyu Apr 2007

A Multimodal And Multilevel Ranking Framework For Content-Based Video Retrieval, Steven C. H. Hoi, Michael R. Lyu

Research Collection School Of Computing and Information Systems

One critical task in content-based video retrieval is to rank search results with combinations of multimodal resources effectively. This paper proposes a novel multimodal and multilevel ranking framework for content-based video retrieval. The main idea of our approach is to represent videos by graphs and learn harmonic ranking functions through fusing multimodal resources over these graphs smoothly. We further tackle the efficiency issue by a multilevel learning scheme, which makes the semi-supervised ranking method practical for large-scale applications. Our empirical evaluations on TRECVID 2005 dataset show that the proposed multimodal and multilevel ranking framework is effective and promising for content-based …

Go to article

Summarizing Review Scores Of "Unequal" Reviewers, Hady W. Lauw, Ee Peng Lim, Ke Wang Apr 2007

Summarizing Review Scores Of "Unequal" Reviewers, Hady W. Lauw, Ee Peng Lim, Ke Wang

Research Collection School Of Computing and Information Systems

A frequently encountered problem in decision making is the following review problem: review a large number of objects and select a small number of the best ones. An example is selecting conference papers from a large number of submissions. This problem involves two sub-problems: assigning reviewers to each object, and summarizing reviewers ’ scores into an overall score that supposedly reflects the quality of an object. In this paper, we address the score summarization sub-problem for the scenario where a small number of reviewers evaluate each object. Simply averaging the scores may not work as even a single reviewer could …

Go to article

Vulnerability Analysis Of Emap: An Efficient Rfid Mutual Authentication Protocol, Tieyan Li, Robert H. Deng Apr 2007

Vulnerability Analysis Of Emap: An Efficient Rfid Mutual Authentication Protocol, Tieyan Li, Robert H. Deng

Research Collection School Of Computing and Information Systems

In this paper, we analyze the security vulnerabilities of EMAP, an efficient RFID mutual authentication protocol recently proposed by Peris-Lopez et al. (2006). We present two effective attacks, a de-synchronization attack and a full-disclosure attack, against the protocol. The former permanently disables the authentication capability of a RFID tag by destroying synchronization between the tag and the RFID reader. The latter completely compromises a tag by extracting all the secret information stored in the tag. The de-synchronization attack can be carried out in just round of interaction in EMAP while the full-disclosure attack is accomplished across several runs of EMAP. …

Go to article

A Multimodal And Multilevel Ranking Framework For Content-Based Video Retrieval, Steven C. H. Hoi, Michael R. Lyu Apr 2007

A Multimodal And Multilevel Ranking Framework For Content-Based Video Retrieval, Steven C. H. Hoi, Michael R. Lyu

Research Collection School Of Computing and Information Systems

One critical task in content-based video retrieval is to rank search results with combinations of multimodal resources effectively. This paper proposes a novel multimodal and multilevel ranking framework for content-based video retrieval. The main idea of our approach is to represent videos by graphs and learn harmonic ranking functions through fusing multimodal resources over these graphs smoothly. We further tackle the efficiency issue by a multilevel learning scheme, which makes the semi-supervised ranking method practical for large-scale applications. Our empirical evaluations on TRECVID 2005 dataset show that the proposed multimodal and multilevel ranking framework is effective and promising for content-based …

Go to article

Mining Colossal Frequent Patterns By Core Pattern Fusion, Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu, Hong Cheng Apr 2007

Mining Colossal Frequent Patterns By Core Pattern Fusion, Feida Zhu, Xifeng Yan, Jiawei Han, Philip S. Yu, Hong Cheng

Research Collection School Of Computing and Information Systems

Extensive research for frequent-pattern mining in the past decade has brought forth a number of pattern mining algorithms that are both effective and efficient. However, the existing frequent-pattern mining algorithms encounter challenges at mining rather large patterns, called colossal frequent patterns, in the presence of an explosive number of frequent patterns. Colossal patterns are critical to many applications, especially in domains like bioinformatics. In this study, we investigate a novel mining approach called Pattern-Fusion to efficiently find a good approximation to the colossal patterns. With Pattern-Fusion, a colossal pattern is discovered by fusing its small core patterns in one step, …

Go to article

Efficient Algorithms For Machine Scheduling Problems With Earliness And Tardiness Penalties, Guang Feng, Hoong Chuin Lau Mar 2007

Efficient Algorithms For Machine Scheduling Problems With Earliness And Tardiness Penalties, Guang Feng, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

In this paper, we study the multi-machine scheduling problem with earliness and tardiness penalties and sequence dependent setup times. This problem can be decomposed into two subproblems—sequencing and timetabling. Sequencing focuses on assigning each job to a fixed machine and determine the job sequence on each machine. We call such assignment a semi-schedule. Timetabling focuses on finding an executable schedule from the semi-schedule via idle-time insertion. Sequencing is strongly NP-hard in general. Although timetabling is polynomial-time solvable, it can become a computational bottleneck if the procedure is executed many times within a larger framework. This paper makes two contributions. We …

Go to article

First Prev Next Last