Premium Essay

In: Science

Submitted By mrs1987

Words 11016

Pages 45

Words 11016

Pages 45

Faculty of Mathematical Studies, University of Southampton, Southampton, SO17 1BJ, UK Faculty of Mathematical Studies, University of Southampton, Southampton, SO17 1BJ, UK Department of Decision and Information Sciences, Rotterdam School of Management, Erasmus University, P.O. Box 1738, 3000 DR Rotterdam, The Netherlands Richard.Congram@paconsulting.com • C.N.Potts@maths.soton.ac.uk • S.Velde@fac.fbk.eur.nl

Richard K. Congram • Chris N. Potts • Steef L. van de Velde

T

his paper introduces a new neighborhood search technique, called dynasearch, that uses dynamic programming to search an exponential size neighborhood in polynomial time. While traditional local search algorithms make a single move at each iteration, dynasearch allows a series of moves to be performed. The aim is for the lookahead capabilities of dynasearch to prevent the search from being attracted to poor local optima. We evaluate dynasearch by applying it to the problem of scheduling jobs on a single machine to minimize the total weighted tardiness of the jobs. Dynasearch is more effective than traditional ﬁrst-improve or best-improve descent in our computational tests. Furthermore, this superiority is much greater for starting solutions close to previous local minima. Computational results also show that an iterated dynasearch algorithm in which descents are performed a few random moves away from previous local minima is superior to other known local search procedures for the total weighted tardiness scheduling problem. (Production Scheduling: Single Machine, Sequencing; Analysis of Algorithms; Dynamic Programming )

1.

A descent or iterative improvement algorithm is a simple and practical type of local search method for obtaining near-optimal solutions for a wide variety of NP-hard…...

Free Essay

...the Flow Shop Scheduling Problem with Late Work Criterion Jacek Błażewicz *) Erwin Pesch 1) Małgorzata Sterna 2) Frank Werner 3) *) Institute of Computing Science, Poznań University of Technology Piotrowo 3A, 60-965 Poznań, Poland phone: +48 (61) 8790 790 fax: +48 (61) 8771 525 blazewic@sol.put.poznan.pl Institute of Information Systems, FB 5 - Faculty of Economics, University of Siegen Hölderlinstrasse 3, 57068 Siegen, Germany pesch@fb5.uni-siegen.de Institute of Computing Science, Poznań University of Technology Piotrowo 3A, 60-965 Poznań, Poland Malgorzata.Sterna@cs.put.poznan.pl Faculty of Mathematics, Otto-von-Guericke-University PSF 4120, 39016 Magdeburg, Germany Frank.Werner@mathematik.uni-magdeburg.de 1) 2) 3) 1 A Comparison of Solution Procedures for the Flow Shop Scheduling Problem with Late Work Criterion Abstract In this paper, we analyze different solution procedures for the two-machine flow shop scheduling problem with a common due date and the weighted late work criterion, i.e. for problem F2 | dj = d | Yw, which is known to be binary NP-hard. In computational experiments, we compare the practical efficiency of a dynamic programming approach, an enumerative method and a heuristic list scheduling procedure. Test results show that each solution method has its advantages and none of them can be rejected from the consideration a priori. Keywords: flow shop, late work, dynamic programming, enumerative method, list......

Words: 9053 - Pages: 37

Free Essay

...49, 8657–8669 8657 Single-Stage Scheduling of Multiproduct Batch Plants: An Edible-Oil Deodorizer Case Study Songsong Liu,† Jose M. Pinto,‡ and Lazaros G. Papageorgiou*,† Centre for Process Systems Engineering, Department of Chemical Engineering, UniVersity College London, Torrington Place, London WC1E 7JE, U.K., and Process Systems R&D, Praxair Inc., 39 Old Ridgebury Rad, Danbury, Connecticut 06810 This article considers the short-term scheduling of a single-stage batch edible-oil deodorizer that can process multiple products in several product groups. Sequence-dependent changeovers occur when switching from one product group to another. Based on the incorporation of products into product groups, mixed integer linear programming (MILP) models are proposed for two scenarios, with and without backlogs. Then, the models are successfully applied to a real-world case with 70 product orders over a 128-h planning horizon. Compared with a literature model developed for a similar problem, the proposed models exhibit signiﬁcantly better performance. 1. Introduction In the past decade, a large number of optimization models and approaches have been proposed for batch scheduling and planning. A number of reviews on the planning and scheduling of batch processes have been presented in the literature.1-6 Initially, discrete-time formulation models using the state-task network7 (STN) or resource-task network8 (RTN) were used for batch scheduling problems. Because discrete-time......

Words: 7686 - Pages: 31

Free Essay

...Introduction to Algorithms Second Edition This page intentionally left blank Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Clifford Stein Introduction to Algorithms Second Edition The MIT Press Cambridge, Massachusetts London, England Dubuque, IA St. Louis Montr´ al e Madison, WI Toronto McGraw-Hill Book Company Boston Burr Ridge, IL New York San Francisco This book is one of a series of texts written by faculty of the Electrical Engineering and Computer Science Department at the Massachusetts Institute of Technology. It was edited and produced by The MIT Press under a joint production-distribution agreement with the McGraw-Hill Book Company. Ordering Information: North America Text orders should be addressed to the McGraw-Hill Book Company. All other orders should be addressed to The MIT Press. Outside North America All orders should be addressed to The MIT Press or its local distributor. Third printing, 2002 c 2001 by The Massachusetts Institute of Technology First edition 1990 All rights reserved. No part of this book may be reproduced in any form or by any electronic or mechanical means (including photocopying, recording, or information storage and retrieval) without permission in writing from the publisher. This book was printed and bound in the United States of America. Library of Congress Cataloging-in-Publication Data Introduction to algorithms / Thomas H. Cormen . . . [et al.].—2nd ed. p. cm. Includes bibliographical references and...

Words: 426328 - Pages: 1706

Free Essay

...Approximation Algorithms Springer Berlin Heidelberg NewYork Barcelona Hong Kong London Milan Paris Singapore Tokyo To my parents Preface Although this may seem a paradox, all exact science is dominated by the idea of approximation. Bertrand Russell (1872–1970) Most natural optimization problems, including those arising in important application areas, are NP-hard. Therefore, under the widely believed conjecture that P = NP, their exact solution is prohibitively time consuming. Charting the landscape of approximability of these problems, via polynomial time algorithms, therefore becomes a compelling subject of scientiﬁc inquiry in computer science and mathematics. This book presents the theory of approximation algorithms as it stands today. It is reasonable to expect the picture to change with time. The book is divided into three parts. In Part I we cover a combinatorial algorithms for a number of important problems, using a wide variety of algorithm design techniques. The latter may give Part I a non-cohesive appearance. However, this is to be expected – nature is very rich, and we cannot expect a few tricks to help solve the diverse collection of NP-hard problems. Indeed, in this part, we have purposely refrained from tightly categorizing algorithmic techniques so as not to trivialize matters. Instead, we have attempted to capture, as accurately as possible, the individual character of each problem, and point out connections between problems and algorithms for solving......

Words: 140657 - Pages: 563

Free Essay

...Genetic Algorithm N. Suguna1, and Dr. K. Thanushkodi2 1 Professor in Computer Science and Engg, Akshaya College of Engineering and Technology, Coimbatore, Tamil Nadu, India. 2 Director, Akshaya College of Engineering and Technology, Coimbatore, Tamil Nadu, India. Abstract k-Nearest Neighbor (KNN) is one of the most popular algorithms for pattern recognition. Many researchers have found that the KNN algorithm accomplishes very good performance in their experiments on different data sets. The traditional KNN text classification algorithm has three limitations: (i) calculation complexity due to the usage of all the training samples for classification, (ii) the performance is solely dependent on the training set, and (iii) there is no weight difference between samples. To overcome these limitations, an improved version of KNN is proposed in this paper. Genetic Algorithm (GA) is combined with KNN to improve its classification performance. Instead of considering all the training samples and taking k-neighbors, the GA is employed to take k-neighbors straightaway and then calculate the distance to classify the test samples. Before classification, initially the reduced feature set is received from a novel method based on Rough set theory hybrid with Bee Colony Optimization (BCO) as we have discussed in our earlier work. The performance is compared with the traditional KNN, CART and SVM classifiers. Keywords: k-Nearest Neighbor, Genetic Algorithm, Support Vector......

Words: 3528 - Pages: 15

Free Essay

...CMIS 102 4060 Introduction to Problem Solving and Algorithm Design HOMEWORK 2 Declare CPUCost As Float Declare CaseCost As Float Declare PowerSupplyCost As Float Declare Motherboard As Float Declare HardDriveCost As Float Declare RAMCost As Float Declare DVDCost As Float Declare SoundCardCost As Float Declare MonitorCost As Float Declare GraphicsCardCost As Float Declare OperatingSystem Cost As Float //Prompt for and input the computer price: Write “Enter the computer price:” Input ComputerPrice Call Compute_CPU_Cost module Call Compute_Case_Cost module Call Compute_Power_Supply_Cost module Call Compute_Motherboard_Cost module Call Compute_Hard_Drive_Cost module Call Compute_RAM_Cost module Call Compute_DVD_Cost module Call Compute_Monitor_Card_Cost module Call Compute_Graphics_Card_Cost module Call Compute_Operating_System_Cost module End Program Declare CPUCost as Character //Display the menu and input user selection: Write “S – Intel i7” Write “E – Intel i5” Write “D – Intel i3” Write “Selection” Input CPU Choice Select Case of CPU Choice Case “S”: Set CPUCost = 319 Break Case “E”: Set CPUCost = 229 Break Case “D”: Set CPUCost = 119 Break Default: Write” Invalid Selection” End Case Declare CaseCost as Character //Display the menu and input user selection: Write “V – Thermaltake V3” Write “C – NZXT Guardian” Write “L – Cooler Master Elite 430” Write “Selection” Input Case Choice Select Case of Case Choice Case......

Words: 311 - Pages: 2

Free Essay

...151 Log 6/17- 4x4 1 twisted clip 6/18- Venza/Highlander 23 twisted clips 6/19 Issuse with twisting clip maintenance fixed at 430 3 twisted clips after maintenance fixed machine 6/20 Tundra 12 Gaped clips 6/21- Brenda ran 4x2 2hour change over 6/24 5 twisted clips 6/25 6 rolled boots 6/26 6 twisted clips, 4 rolled boots, and 1 metal to metal clip(seat not properly set) 6/27 2 rolled boots 6/28 None 7/1 None 7/2 None 7/3 None 7/8 On Vacation Tommy Viars found 4 rolled boots 7/9 2 Misaligned ball studs, 1 twisted clip TL fixed 7/10 Part missing out of top tote while running venza 7/11 2 twisted clips , 1 misassembled boot (metal from the ball stud showing) 7/12 2 twisted clips 1 rolled boot 7/22 2 twisted clips 7/23 1 twisted clip 1 rolled boot. Phillip didn’t change over 151 completely although he said he did he didn’t change the top of the machine over just the bottom; after talking to the Tommy Vairs this was the second time this has happened 7/24 Cathy spoke to Phillip about the 151 change overs after that 5 twisted clips 7/25 Started Eddy and Phillip training on 151 and 131 Phillips numbers didn’t match his paperwork by 100 parts, Phillip stated that he hit his number reset 30 min into the shift and this is why the numbers didn’t match 7/26 Eddy 4 hours no issues ; Phillip 4 hours had 3 twisted clips 7/29 Eddy 4 hours No issues, Phillip 4 hours 6 twisted clips...

Words: 279 - Pages: 2

Free Essay

...if G contains an edge (u,v) then u appears before v in the order. 1. call DFS(G) to compute finishing times v.f for each vertex v 2. as each vertex is finished insert it onto the front of a linked list 3. return the linked list of vertices 4. Lecture 5 (01/28) Posted on: Monday, January 28, 2013 Topics: Strongly Connected Components, Activity Selection Reading: CLRS (22.5, 16.1), KT (4.1) Scheduling Probelem Set of n activities which can be served only one at a time, each with start time s and finish time f Selecct a maximum-size subset of mutually compatible activities (meaning no overlap) GREEDY ALGORITHM Note that putting the job with the earliest finish time allows for the most amount of jobs to follow, because it allows the machine to have the most possible time to get to other jobs Take job with lowest finish time, then reduce set to all job that don’t overlap, then choose lowest finishing time, recursively. * Lecture 6 (01/30) Posted on: Wednesday, January 30, 2013 Topics: Activity Selection, Coloring Interval Graphs, Scheduling Reading: CLRS (16.1, 16.2), KT (4.1, 4.2) * Lecture 07 (02/04) Posted on: Wednesday, February 6, 2013 Topics: Minimizing Maximum Lateness, Sorting (Insertion Sort, Merge Sort, Quick Sort) Reading: CLRS (Chp 2, 7.1, 7.2), KT (4.2) Insertion sort Starting from the second element as key value, while the key value taken is less than the element in the array corresponding to the counter (running down from...

Words: 5019 - Pages: 21

Free Essay

...Foundations of Machine Learning Adaptive Computation and Machine Learning Thomas Dietterich, Editor Christopher Bishop, David Heckerman, Michael Jordan, and Michael Kearns, Associate Editors A complete list of books published in The Adaptive Computations and Machine Learning series appears at the back of this book. Foundations of Machine Learning Mehryar Mohri, Afshin Rostamizadeh, and Ameet Talwalkar The MIT Press Cambridge, Massachusetts London, England c 2012 Massachusetts Institute of Technology All rights reserved. No part of this book may be reproduced in any form by any electronic or mechanical means (including photocopying, recording, or information storage and retrieval) without permission in writing from the publisher. MIT Press books may be purchased at special quantity discounts for business or sales promotional use. For information, please email special sales@mitpress.mit.edu or write to Special Sales Department, The MIT Press, 55 Hayward Street, Cambridge, MA 02142. A This book was set in L TEX by the authors. Printed and bound in the United States of America. Library of Congress Cataloging-in-Publication Data Mohri, Mehryar. Foundations of machine learning / Mehryar Mohri, Afshin Rostamizadeh, and Ameet Talwalkar. p. cm. - (Adaptive computation and machine learning series) Includes bibliographical references and index. ISBN 978-0-262-01825-8 (hardcover : alk. paper) 1. Machine learning. 2. Computer algorithms. I. Rostamizadeh, Afshin.......

Words: 137818 - Pages: 552

Free Essay

...2.5 SCHEDULING When a computer is multiprogrammed, it frequently has multiple processes competing for the CPU at the same time. This situation occurs whenever two or more processes are simultaneously in the ready state. If only one CPU is available, a choice has to be made which process to run next. The part of the operating system that makes the choice is called the scheduler and the algorithm it uses is called the scheduling algorithm. These topics form the subject matter of the following sections. Many of the same issues that apply to process scheduling also apply to thread scheduling, although some are different. Initially we will focus on process scheduling. Later on we will explicitly look at thread scheduling. 2.5.1 Introduction to Scheduling Back in the old days of batch systems with input in the form of card images on a magnetic tape, the scheduling algorithm was simple: just run the next job on the tape. With timesharing systems, the scheduling algorithm became more complex because there were generally multiple users waiting for service. Some mainframes still combine batch and timesharing service, requiring the scheduler to decide whether a batch job or an interactive user at a terminal should go next. (As an aside, a batch job may be a request to run multiple programs in succession, but for this section, we will just assume it is a request to run a single program.) Because CPU time is a scarce resource on these machines, a good scheduler can make a big difference......

Words: 8932 - Pages: 36

Free Essay

...T C L I F F O R D STEIN INTRODUCTION TO ALGORITHMS T H I R D E D I T I O N Introduction to Algorithms Third Edition Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Clifford Stein Introduction to Algorithms Third Edition The MIT Press Cambridge, Massachusetts London, England c 2009 Massachusetts Institute of Technology All rights reserved. No part of this book may be reproduced in any form or by any electronic or mechanical means (including photocopying, recording, or information storage and retrieval) without permission in writing from the publisher. For information about special quantity discounts, please email special sales@mitpress.mit.edu. This book was set in Times Roman and Mathtime Pro 2 by the authors. Printed and bound in the United States of America. Library of Congress Cataloging-in-Publication Data Introduction to algorithms / Thomas H. Cormen . . . [et al.].—3rd ed. p. cm. Includes bibliographical references and index. ISBN 978-0-262-03384-8 (hardcover : alk. paper)—ISBN 978-0-262-53305-8 (pbk. : alk. paper) 1. Computer programming. 2. Computer algorithms. I. Cormen, Thomas H. QA76.6.I5858 2009 005.1—dc22 10 9 8 7 6 5 4 3 2 2009008593 Contents Preface xiii I Foundations 1 2 Introduction The Role of Algorithms in Computing 5 1.1 Algorithms 5 1.2 Algorithms as a technology 11 Getting Started 16 2.1 Insertion sort 16 2.2 Analyzing algorithms 23 2.3 Designing algorithms 29 3 3 4 Growth of Functions 43 3.1......

Words: 387342 - Pages: 1550

Free Essay

...FINAL YEAR PROJECT On DESIGNING A SIMULATOR TO IMPLEMENT A JOB SCHEDULER BASED ON DIFFERENT POPULAR CPU SCHEDULING ALGORITHMS Submitted as partial fulfillment for the award of BACHELOR OF TECHNOLOGY Session 2014-15 In Computer Science & Engineering Under the guidance of Mr.MrinmoySen By AnanyaDas(11/CS/15, ananyadas092@gmail.com, +919681851782) AnshumanMahanty(11/CS/23, anshumanmahanty1@gmail.com, +917501169824) SayaniBanerjee(11/CS/93, sayanibanerjee.1@gmail.com, +919046422003) HALDIA INSTITUTE OF TECHNOLOGY, HALDIA CERTIFICATE This is to certify that the final year project (CS792) on ‘Designing a Simulator implementing job scheduler based on different popular CPU scheduling algorithms’ has been completed and submitted successfully by the project members Ananya Das (11/CS/15), Anshuman Mahanty (11/CS/23) and Sayani Banerjee (11/CS/93). ------------------------- -------------------------------- --------------------------- Mr. Tarun Kumar Ghosh Mr. Sourav Mandal, Mr. Mrinmoy Sen Head of the Department, Convenor, Asst. Prof., Project Mentor, Asst. Prof., Computer Science & Engg. Project Evaluation Committee Department of CSE ACKNOWLEDGEMENTS We use this opportunity to express our gratitude to everyone who has supported us through the ongoing course of this final year project. The project owes its success not......

Words: 6989 - Pages: 28

Premium Essay

...A Distributed Joint Channel-Assignment, Scheduling and Routing Algorithm for Multi-Channel Ad Hoc Wireless Networks Xiaojun Lin and Shahzada Rasool School of Electrical and Computer Engineering, Purdue University West Lafayette, IN 47907, U.S.A. {linx,srasool}@ecn.purdue.edu Abstract— The capacity of ad hoc wireless networks can be substantially increased by equipping each network node with multiple radio interfaces that can operate on multiple non-overlapping channels. However, new scheduling, channelassignment, and routing algorithms are required to fully utilize the increased bandwidth in multi-channel multi-radio ad hoc networks. In this paper, we develop a fully distributed algorithm that jointly solves the channel-assignment, scheduling and routing problem. Our algorithm is an online algorithm, i.e., it does not require prior information on the offered load to the network, and can adapt automatically to the changes in the network topology and offered load. We show that our algorithm is provably efﬁcient. That is, even compared with the optimal centralized and ofﬂine algorithm, our proposed distributed algorithm can achieve a provable fraction of the maximum system capacity. Further, the achievable fraction that we can guarantee is larger than that of some other comparable algorithms in the literature. I. I NTRODUCTION Multi-channel multi-radio ad hoc wireless networks have recently received a substantial amount of interest, especially under...

Words: 8961 - Pages: 36

Free Essay

...Single-Machine Scheduling with Deteriorating Processing Times and Release Dates ∗ In this paper, we consider a single-machine scheduling problem where jobs have release dates and deteriorating processing times. Formally, a set of n jobs N = {1, 2, . . . , n} is to be processed on a single machine without preemption. Let N = {1 , 2 , . . . , n } be the job set obtained from N by deﬁning job i using the i−th largest elements in {b1 , b2 , . . . , bn } and the i−th smallest element in {r1 , r2 , . . . , rn }. Lemma 1 The optimal total completion time of the derived set N is no greater than that of job set N . Proof: Let S ∗ be an optimal schedule for 1/pi = a + bi (si − ri )/ Ci . Our proof consists of two phases. In phase one, we derive from S ∗ a schedule in which the jobs are sequenced in non-increasing order of penalty rates. Based upon this derived schedule, phase two deduces another schedule where the jobs are arranged in non-decreasing order of release dates. The derived schedule has a total completion time no greater than schedule S ∗ . Consider two consecutive jobs i and j such that i is the immediate predecessor job j and bi < bj . Denote the starting time of job i by t0 . Then, we have Ci = t0 + (a + bi (t0 − ri )), and Cj = t0 + (a + bi (t0 − ri )) + (a + bj (t0 + a + bi (t0 − ri )) − rj ). After the interchange of bi and bj without altering any other parameters, we have the following two completion times: Ci = t0 + (a + bj (t0 − ri )) , and Cj = t0 + (a + bj (t0......

Words: 534 - Pages: 3

Free Essay

...Data Mining Algorithms for Classiﬁcation BSc Thesis Artiﬁcial Intelligence Author: Patrick Ozer Radboud University Nijmegen January 2008 Supervisor: Dr. I.G. Sprinkhuizen-Kuyper Radboud University Nijmegen Abstract Data Mining is a technique used in various domains to give meaning to the available data. In classiﬁcation tree modeling the data is classiﬁed to make predictions about new data. Using old data to predict new data has the danger of being too ﬁtted on the old data. But that problem can be solved by pruning methods which degeneralizes the modeled tree. This paper describes the use of classiﬁcation trees and shows two methods of pruning them. An experiment has been set up using diﬀerent kinds of classiﬁcation tree algorithms with different pruning methods to test the performance of the algorithms and pruning methods. This paper also analyzes data set properties to ﬁnd relations between them and the classiﬁcation algorithms and pruning methods. 2 1 Introduction The last few years Data Mining has become more and more popular. Together with the information age, the digital revolution made it necessary to use some heuristics to be able to analyze the large amount of data that has become available. Data Mining has especially become popular in the ﬁelds of forensic science, fraud analysis and healthcare, for it reduces costs in time and money. One of the deﬁnitions of Data Mining is; “Data Mining is a process that consists of applying data analysis and......

Words: 5455 - Pages: 22