1 Revision Main textbooks: Operations Scheduling with Applications in Manufacturing and Services, Michael Pinedo and Xiuli Chao, McGraw Hill, 2000. Scheduling,

Slides:



Advertisements
Similar presentations
On the Complexity of Scheduling
Advertisements

Makespan with Sequence Dependent Setup Time (MSDST) 1|s jk |C max.
1 Tabu Search Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations.
1 Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations.
Simultaneous scheduling of machines and automated guided vehicles: graph modelling and resolution Philippe LACOMME, Mohand LARABI Nikolay TCHERNEV LIMOS.
Lecture 6: Job Shop Scheduling Introduction
Multi-Objective Optimization NP-Hard Conflicting objectives – Flow shop with both minimum makespan and tardiness objective – TSP problem with minimum distance,
ISE480 Sequencing and Scheduling Izmir University of Economics ISE Fall Semestre.
NP-Complete William Strickland COT4810 Spring 2008 February 7, 2008.
1 Welcome to G53ASD AUTOMATED SCHEDULING Lecturer: Dr. Sanja Petrovic School of Computer Science and Information Technology The.
Lateness Models Contents
1 Project Scheduling Contents 1. Problem Statement 2. Critical Path Method 3. Extensions to the classical project scheduling problems Literature Operations.
1 Single Machine Deterministic Models Jobs: J 1, J 2,..., J n Assumptions: The machine is always available throughout the scheduling period. The machine.
21st European Conference on Operational Research Algorithms for flexible flow shop problems with unrelated parallel machines, setup times and dual criteria.
1 IOE/MFG 543 Chapter 14: General purpose procedures for scheduling in practice Sections : Dispatching rules and filtered beam search.
Ant Colony Optimization Optimisation Methods. Overview.
1 Set # 4 Dr. LEE Heung Wing Joseph Phone: Office : HJ639.
T. P. Hong 1 Research Artificial Intelligence Expert Systems Machine Learning Knowledge Integration Heuristic Search Parallel Processing Top-down Bottom-up.
CHAPTER 19 Scheduling Operations Management, Eighth Edition, by William J. Stevenson Copyright © 2005 by The McGraw-Hill Companies, Inc. All rights reserved.
METU Computer Engineering Department
Production Planning and Control Introduction
INTRODUCTION TO SCHEDULING
Production Scheduling: operations scheduling with applications in manufacturing and services Pei-Chann Chang RM 2614, tel. 2305,
KE22 FINAL YEAR PROJECT Modeling and Simulation of Milling Forces SIMTech Project Ryan Soon, Henry Woo, Yong Boon April 9, 2011 Confidential – Internal.
Scheduling and Scheduling Philosophies By Nilesh Sivaramakrishnan For IEM 5303.
Introduction to LEKIN Gareth Beddoe
Job-shop Scheduling n jobs m machines No recirculation – Jobs do not revisit the same machine (i, j) is referred to as an operation in which job j is processed.
15-1Scheduling William J. Stevenson Operations Management 8 th edition.
Optimized Search Heuristics: a Survey Susana Fernandes Universidade do Algarve Faro, Portugal Helena Ramalhinho Lourenço Universitat Pompeu.
15-1Scheduling William J. Stevenson Operations Management 8 th edition.
1 Design of Scheduling Systems Contents 1. Architecture of Scheduling Systems 2. Databases, Object Bases, Knowledge Bases 3. Schedule Generation 4. User.
Assoc. Prof. Abdulwahab AlSammak. Course Information Course Title: Artificial Intelligence Instructor : Assoc. Prof. Abdulwahab AlSammak
1 Fuzzy Scheduling Contents 1. Introduction to Fuzzy Sets 2. Application of Fuzzy Sets to Scheduling Problems 3. A Genetic Algorithm for Fuzzy Flowshop.
1 Short Term Scheduling. 2  Planning horizon is short  Multiple unique jobs (tasks) with varying processing times and due dates  Multiple unique jobs.
1 Contents 1. Statement of Timetabling Problems 2. Approaches to Timetabling Problems 3. Some Innovations in Meta-Heuristic Methods for Timetabling University.
Dvir Shabtay Moshe Kaspi The Department of IE&M Ben-Gurion University of the Negev, Israel.
1 Lecturer: Dr Sanja Petrovic School of Computer Science and Information Technology
Outline Schedule and scheduling Mathematical models
Heuristic Methods for the Single- Machine Problem Chapter 4 Elements of Sequencing and Scheduling by Kenneth R. Baker Byung-Hyun Ha R2.
Transparency Masters to accompany Heizer/Render – Principles of Operations Management, 5e, and Operations Management, 7e © 2004 by Prentice Hall, Inc.,
Asst. Prof. Dr. Ahmet ÜNVEREN, Asst. Prof. Dr. Adnan ACAN.
1 Simulated Annealing Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations.
1 Exercise 1. (a) Find all optimal sequences for the scheduling problem 1 ||  w j C j with the following jobs. (b) Determine the effect of a change in.
1 Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations Genetic Algorithm (GA)
1 Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations Simulated Annealing (SA)
1 Job Shop Scheduling. 2 Job shop environment: m machines, n jobs objective function Each job follows a predetermined route Routes are not necessarily.
Introduction to Artificial Intelligence Heshaam Faili University of Tehran.
1 Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations.
Artificial Intelligence
Some Topics in OR.
Litteraturliste (1) C. R. Reeves (editor): Modern Heuristic Techniques for Combinatorial Problems. ISBN Blackwell 1993.  I.H. Osman, J.P.
Job Shop Scheduling Contents 1. Problem Statement 2. Disjunctive Graph
CHAPTER 8 Operations Scheduling
Sistem Kecerdasan Buatan
RESEARCH APPROACH.
Project Scheduling Contents 1. Problem Statement
Employee Timetabling Contents
General Purpose Procedures Applied to Scheduling
Off the peg or made to measure
كاربردهاي آن در مهندسي صنايع
Sequencing and Scheduling Introduction and Chapter 1
Modeling Scheduling Problems
CH751 퍼지시스템 특강 Uncertainties in Intelligent Systems
Introduction to Scheduling Chapter 1
Subset of Slides from Lei Li, HongRui Liu, Roberto Lu
The use of Neural Networks to schedule flow-shop with dynamic job arrival ‘A Multi-Neural Network Learning for lot Sizing and Sequencing on a Flow-Shop’
Planning and Scheduling in Manufacturing and Services
Topic 15 Job Shop Scheduling.
IOE/MFG 543 Chapter 14: General purpose procedures for scheduling in practice Sections : Dispatching rules and filtered beam search.
Single Machine Deterministic Models
Presentation transcript:

1 Revision Main textbooks: Operations Scheduling with Applications in Manufacturing and Services, Michael Pinedo and Xiuli Chao, McGraw Hill, Scheduling, Theory, Algorithms, and Systems, Michael Pinedo, Prentice Hall, 1995, or new: Second Addition, 2002

2 1.Introduction (6) Scheduling, Theory, Algorithms, and Systems, Chapter 1 or Operations Scheduling with Applications in Manufacturing and Services, Chapter 1 2.Introduction to Scheduling (22) Classification of Scheduling Problems Scheduling, Theory, Algorithms, and Systems, Chapters 1 and 2 or Operations Scheduling with Applications in Manufacturing and Services, Chapters 1 and 2

3 3.General Purpose Procedures Applied to Scheduling (a) Dispatching Rules (10) (b) Simulated Annealing (9) (c) Tabu Search (7) (d) Genetic Algorithm (15) (b) - (d) Modern Heuristic Techniques for Combinatorial Problems, (Ed.) C.Reeves 1995, McGraw-Hill. Chapters 2, 3, 4. (a) -(d) Operations Scheduling with Applications in Manufacturing and Services, Chapter 3 or Scheduling, Theory, Algorithms, and Systems, Second Addition, Chapter 14

4 4.Graph Colouring Heuristics (11) Graph colouring heuristics based on saturation degree Operations Scheduling with Applications in Manufacturing and Services, Michael Pinedo and Xiuli Chao, McGraw Hill, 2000 Chapter 8.4. or Deterministic Scheduling Theory, Gary Parker, Chapman & Hall, Chapter 6.1.

5 5. University Timetabling (20) Approaches to timetabling problems A Memetic algorithm for exam timetabling "Recent Research Directions in Automated Timetabling", Burke, E.K., Petrovic,S., accepted for publication in European Journal of Operational Research - EJOR, "A Memetic Algorithm for University Exam Timetabling", Burke, E.K., Newall, J.P., Weare, R.F., 1996b. In: (Eds.) Burke, E., Ross, P. The Practice and Theory of Automated Timetabling: Selected Papers from the 1st Int'l Conf. on the Practice and Theory of Automated Timetabling, Napier University, August/September 1995, Springer Lecture Notes in Computer Science Series, Vol , pages

6 6.Employee Timetabling (15) Algorithm for single shift schedules Operations Scheduling with Applications in Manufacturing and Services, Michael Pinedo and Xiuli Chao, McGraw Hill, Chapter 9 or "Work Force Size and Single Shift Schedules with Variable Demands”, Burns, R.N., Carter, M.W., Management Science 31, 1985, pages

7 7. Single Machine Deterministic Models (a) Completion Time Models (14) Algorithm for 1 ||  w j C j Algorithm for 1 | chain |  w j C j (b) Lateness Models (18) Algorithm for 1 | prec | h max Branch-and-bound algorithm for 1 | r j | L max (c) Tardiness Models(11) Algorithm for 1 ||  U j Algorithm for 1 ||  T j (d) Sequence Dependent Setup Problems (20) Algorithm for 1 | S jk | C max (a)-(d): Scheduling, Theory, Algorithms, and Systems, Chapter 3 (d) “Sequencing a One State-Variable Machine: A Solvable Case of the Travelling Salesman Problem” Gilmore, Gomory, Operations Research 12, 1964,

8 8.Project Scheduling (6) Critical Path Method Operations Scheduling with Applications in Manufacturing and Services, Chapter Flow Shop Scheduling (5) Johnson's rule Heuristic Scheduling Systems with Applications to Production Systems and Project Management, Thomas Morton and David Pentico, A Volume in the Wiley Series in Engineering and Technology Management, (Ed.) D.Kocaoglu, 1993, Chapter

9 10.Job Shop Scheduling (27) Shifting Bottleneck Heuristic Operations Scheduling with Applications in Manufacturing and Services, Chapter 5 or Scheduling, Theory, Algorithms, and Systems, Chapter Design of Scheduling Systems (20) Demonstration of the scheduling system LEKIN Operations Scheduling with Applications in Manufacturing and Services, Michael Pinedo and Xiuli Chao, McGraw Hill, 2000 Chapter 10 "Knowledge-Based Approaches for Scheduling Problems", Noronha, S.,J., and Sarma, V.V.S., IEEE Transaction on Knowledge and Data Engineering, Vol. 3., pages

Fuzzy Scheduling (29) The basic idea of Fuzzy Rules Genetic Algorithm for Fuzzy Flowshop Scheduling Problem Fuzzy sets, uncertainty, and information, G. J. Klir and T.A. Folger. Englewood Cliffs, N.J : Prentice Hall, Chapter ? "Flowshop Scheduling with Fuzzy Duedate and Fuzzy Processing Time", by H. Ishibuchi and T. Nurata, in: Scheduling Under Fuzziness, R. Slowinski, and M. Hapke, (eds), Physica-Verlag, A Springer-Verlag Company, 2000, pages or "Genetic algorithms and neighborhood search algorithms for fuzzy flowshop scheduling problems", Ishibuchi, H., Yamamoto, N., Murata, T., Tanaka., H, Fuzzy Sets and Systems Vol. 67, No.1, pages

Solving a Nurse Rostering Problem with Enhanced Tabu Search The basic ideas behind the algorithm for tabu search for nurse rostering. Nurse scheduling with tabu search and strategic oscillation, Dowslend K. European Journal of Operational Research Vol. 106, 1998 pages