Xiaofei Xu School of Computer Science and Technology Harbin Institute of Technology Model and Problem Generation Tool of Project Scheduling.

Slides:



Advertisements
Similar presentations
On the Complexity of Scheduling
Advertisements

YUSUF OZ FATIH BOLUKBAS HUSEYIN ANIL KARABULUT SITE LAYOUT.
Operations Scheduling
Hadi Goudarzi and Massoud Pedram
VSMC MIMO: A Spectral Efficient Scheme for Cooperative Relay in Cognitive Radio Networks 1.
Logistics Network Configuration
Using Parallel Genetic Algorithm in a Predictive Job Scheduling
Demonstrators: Mudasir Nazir(08-CS-41).  I am highly addicted to this field.  Working with W3C in research program(building CSS for creating web site.
INTRODUCTION TO MODELING
NetWORKS Strategy Manugistics NetWORKS Strategy 6.2.
Green Cloud Computing Hadi Salimi Distributed Systems Lab, School of Computer Engineering, Iran University of Science and Technology,
Chapter 15 Application of Computer Simulation and Modeling.
Funding Networks Abdullah Sevincer University of Nevada, Reno Department of Computer Science & Engineering.
Introduction To System Analysis and Design
Relational Data Mining in Finance Haonan Zhang CFWin /04/2003.
Chapter 6: An Introduction to System Software and Virtual Machines
Chapter 2 Introduction to Systems Architecture. Chapter goals Discuss the development of automated computing Describe the general capabilities of a computer.
INTRODUCTION TO SCHEDULING
 C. C. Hung, H. Ijaz, E. Jung, and B.-C. Kuo # School of Computing and Software Engineering Southern Polytechnic State University, Marietta, Georgia USA.
Chapter 3 Operating Systems Introduction to CS 1 st Semester, 2015 Sanghyun Park.
COMPLEXITY SCIENCE WORKSHOP 18, 19 June 2015 Systems & Control Research Centre School of Mathematics, Computer Science and Engineering CITY UNIVERSITY.
Object Bank Presenter : Liu Changyu Advisor : Prof. Alex Hauptmann Interest : Multimedia Analysis April 4 th, 2013.
Chapter 1 Introduction Dr. Frank Lee. 1.1 Why Study Compiler? To write more efficient code in a high-level language To provide solid foundation in parsing.
Visual Linker Final presentation.
CMPD 434 MULTIMEDIA AUTHORING Chapter 06 Multimedia Authoring Process IV.
Introduction to Job Shop Scheduling Problem Qianjun Xu Oct. 30, 2001.
Fundamentals of Algorithms MCS - 2 Lecture # 1
Collaboration and Interoperability in Production Management of Ship-Building Industry Prof. Xiaofei XU, Prof. Dechen ZHAN, Dr. Lanshun NIE Business Cases.
Introduction To System Analysis and Design
Computer Science and Engineering Parallel and Distributed Processing CSE 8380 March 01, 2005 Session 14.
Scalable Web Server on Heterogeneous Cluster CHEN Ge.
Metadata Models in Survey Computing Some Results of MetaNet – WG 2 METIS 2004, Geneva W. Grossmann University of Vienna.
Invitation to Computer Science 5 th Edition Chapter 6 An Introduction to System Software and Virtual Machine s.
A Graph Based Algorithm for Data Path Optimization in Custom Processors J. Trajkovic, M. Reshadi, B. Gorjiara, D. Gajski Center for Embedded Computer Systems.
OPERATING SYSTEMS Lecture 3: we will explore the role of the operating system in a computer Networks and Communication Department 1.
PRODUCTION LOGISTICS Introduction Slovak University of Technology Faculty of Material Science and Technology in Trnava.
Modeling and Analysis of Printer Data Paths using Synchronous Data Flow Graphs in Octopus Ashwini Moily Under the supervision of Dr. Lou Somers, Prof.
Compiler Construction (CS-636)
CPSC 171 Introduction to Computer Science System Software and Virtual Machines.
Multiple Instance Learning for Sparse Positive Bags Razvan C. Bunescu Machine Learning Group Department of Computer Sciences University of Texas at Austin.
Energy-Aware Scheduling for Aperiodic Tasks on Multi-core Processors Dawei Li and Jie Wu Department of Computer and Information Sciences Temple University,
Our project main purpose is to develop a tool for a combinatorial game researcher. Given a version of combinatorial puzzle game and few more parameters,
OPERATING SYSTEMS CS 3530 Summer 2014 Systems and Models Chapter 03.
Big traffic data processing framework for intelligent monitoring and recording systems 學生 : 賴弘偉 教授 : 許毅然 作者 : Yingjie Xia a, JinlongChen a,b,n, XindaiLu.
MNP1163/MANP1163 (Software Construction).  Minimizing complexity  Anticipating change  Constructing for verification  Reuse  Standards in software.
CpSc 810: Machine Learning Analytical learning. 2 Copy Right Notice Most slides in this presentation are adopted from slides of text book and various.
© 2008, Renesas Technology America, Inc., All Rights Reserved 1 Introduction Purpose  This course explains how to use Mapview, a utility program for the.
Introduction Complex and large SW. SW crises Expensive HW. Custom SW. Batch execution Structured programming Product SW.
Satisfying Requirements BPF for DRA shall address: –DAQ Environment (Eclipse RCP): Gumtree ISEE workbench integration; –Design Composing and Configurability,
Support Vector Machines Reading: Ben-Hur and Weston, “A User’s Guide to Support Vector Machines” (linked from class web page)
Dynamic Background Learning through Deep Auto-encoder Networks Pei Xu 1, Mao Ye 1, Xue Li 2, Qihe Liu 1, Yi Yang 2 and Jian Ding 3 1.University of Electronic.
Lecture #1: Introduction to Algorithms and Problem Solving Dr. Hmood Al-Dossari King Saud University Department of Computer Science 6 February 2012.
Algorithm A procedure described by a series of steps. Click here for Hint project or algorithm or load distance?
Work-in-process (WIP) Inventory resulting from transformation of raw materials, but not yet ready for sale to consumers. Click here for Hint finished goods.
Introduction to Performance Tuning Chia-heng Tu PAS Lab Summer Workshop 2009 June 30,
Wolfgang Runte Slide University of Osnabrueck, Software Engineering Research Group Wolfgang Runte Software Engineering Research Group Institute.
Project and Project Formulation and Management
Invitation to Computer Science 6th Edition
OPERATING SYSTEMS CS 3502 Fall 2017
Strategic Capacity Management
Course Summary Organization: A process providing goods and services based on a set of inputs, including raw material, capital, labor and knowledge. The.
LOGISTICS NETWORK.
organizational structure
OPTIMIZATION OF PLANAR TRUSS STRUCTURE USING FIREFLY ALGORITHM
Copyright © 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 2 Database System Concepts and Architecture.
Introduction To software engineering
Chapter 1 Introduction(1.1)
Introduction to Scheduling Chapter 1
Planning and Scheduling in Manufacturing and Services
Presentation transcript:

Xiaofei Xu School of Computer Science and Technology Harbin Institute of Technology Model and Problem Generation Tool of Project Scheduling Problem with Spatial Resources NICST’2013 New Information Communication Science and Technology for Sustainable Development: France-China international workshop

Contents Introduction Concepts, features, classification of sRCPSP Problem generation tool for sRCPSP Demonstration of the tool A scheduling algorithm for sRCPSP

Motivation Spatial resources usually belong to strategic/bottleneck resources of OKP and construction enterprises – High investment. – Throughput of factory highly depending on the utilization of spatial resources – Utilizing spatial resources efficiently and schedule activities in projects with limited capacity of spatial resources and other resources to shorten the make- span of projects and increase the output is of great significance! – Spatial resource constrained project scheduling problem (sRCPSP) – Ship-building process.

Background ----Ship-Building process and spatial resources Component machining Assembling/testing at Dock Palletized Components Collection and Distribution ship body assembling & system assembling Purchase and inventory Block assembling & system pre-assembling

Outline Article structure What we do? Analyze! Modeling! Tool! Algorithm! What to solve? When to start activities? Where the activities are carried out? Related research Lee, Koh, Park K, Koh S. et al. Researches on spatial resources and SRCPSP are still limited. Specialty Spatial Occupied by activity group.

Concepts of spatial resource  Spatial resource is a kind of renewable resource with spatiality, which plays a role of holding or accommodating some objects in process.  It is required by a group of activities, rather than a single activity. Accordingly, the group of activities is called a spatial resource activity group.  Shipyard in ship-building process.  Block assembly (erection) platform in ship-building process.

Block assembly platform resource The Block assembly platform resource is occupied by blocks in the ship- building process, which is one kind of bottleneck resources. Utilizing the site resource efficiently is of great significance to improve the production efficiency.

Directivity Divisibility Spatiality Use (σ1,σ2, σ3) to represent spatiality 、 divisibility and directivity,such as ( 1,d,o) represent 1-dimensional 、 can be divided and single-ended release space resource, it can be further simplified as 1do. Characters of Spatial Resource

Classification of the task Call activity Movable activity Release activity Apply spatial resources needed by activity group Spatial resources are movably occupied Release the space occupied by activity group Spatial resource is occupied by activity group while not single activity. There are three kinds of activity in the activity group.

Formulation of sRCPSP The formulation of SRCPSP with objective minimizing make-span is as following: (1)Minimizes the make- span of the project. (2)Denotes the renewable resource related constraints. (3)Forces activities to start after its immediately precedes. (4)Forces every activity to start not before zero. (5)Means that the requirement of every activity group should be satisfied. (6)Ensures that spatial resource blocks allocated to concurrent activity groups are not overlapped. (7)Denotes that activity group does not occupy spatial resource before starting or after ending. (8)Denotes the constraints of spatial resource availability.

A problem generation tool Incorporating spatial resources Has the full function of ProGEN A problem generation tool for sRCPSP. Based on ProGEN Code in java Enrich the tool set of project scheduling

Definition for Input Base file (Input) describes the constraints for project scheduling problem. –Parameters about activity group: MinNofTaskG(MaxNofTaskG): The min(max)number of activity groups in every subproject; MinNofJobTask(MaxNofJobTask): The min(max) number of activities in every activity group; MinNofQJob(MaxNofQJob): The min(max)number of request activities in every activity group; MinNofMJob(MaxNofMJob): The min(max)number of movable activities in every activity group. –Parameters about spatial resources: NofSR : The number of spatial-resource types; SRAmin(SRAmax) : The min(max)kinds of the spatial resources of SRA type; SRAminDemand(SRAmaxDemand) : The min(max) needs of SRA type; SRARmin(SRARmax): The min(max)kinds of needs of activity group for SRA type; SRAF: The resource factor of SRA type; SRAS: The resource intensity of SRA type;

Definition for Output Example file (Output) is used to describe a specific spatial resources project scheduling problem instance. –Additional Parameters (Input and output contain all of the PROGEN’s parameters respectively): –the information of activity group, –the space resources needed by every activity group, –the amount of available space resources –the direction of space resources.

The tool’s Generation method The generation process can be divided into four steps. The number of activities and modes. The start time. ……. Generate specific parameters Generate project network Generate activity group Generate resource needs and available resources The work is very complex. Generate the number of tasks, request tasks and movable tasks. Generate activity group Generate resource's type. Generate resource's level.

Demonstration of the tool GUI of the tool.

Demonstration of the tool An instance of example file.

Demonstration of the tool Project network with activity group has been generated.

A preliminary scheduling algorithm for sRCPSP Where to place When to place The heuristic space scheduling algorithm. Base on configuration space theory. Solve the problem of optimal space layout. The space resources restricted project scheduling algorithm. Base on artificial bee colony ABC. Solve the problem of regular and spatial resources scheduling.

Visual scheduling results The algorithm has a good performance in solving RCPSP with both traditional resource and spatial resource! The utilization percent of each resource: [69%, 71%,82%,56%,89%] Activity number: B-011 Duration: 9 days Start time: The occupation of each resource: [8,10,9,2,10]

Summary Concepts Features Classification Base on ProGEN Consider regular and space resources restricted Demonstration Modeling Formulation Generation method Input and output Click to add Title Base on Configuration space theory Base on Artificial bee colony ABC Demonstration Summary sRCPSP Generation tool Scheduling algorithm

Further works Thanks Prof. Alain Quilliot for guidance in design algorithm for sRCPSP. Further works: –Better model and algorithms –Domain specific sRCPSP –… Collaborating with LIMOS on sRCPSP research

Merci! Thank You! 谢谢! Q & A! Xiaofei Xu School of Computer Science and Technology Harbin Institute of Technology