Automated Scheduling

Demonstration of LEKIN - Software System for Production Scheduling

Contents 1. Introduction to LEKIN 2. Machine environments 3. Methods 4. Criteria 5. Graphical user interface 6. Steps for generating a schedule 7. Examples: a single machine problem a flow shop problem

Planning and Scheduling in Manufacturing and Services Michael Pinedo, Springer Series in Operations Research and Financial Engineering, 2005, Chapter 5.6 or Operations Scheduling with Applications in Manufacturing and Services, Michael Pinedo and Xiuli Chao, McGraw Hill, 2000 Appendix C or Scheduling, Theory, Algorithms, and Systems, Michael Pinedo, Prentice Hall, Second Addition, 2002, 19.6

Introduction to LEKIN

Machine Environments
Single Machine Parallel Machines Flow Shop Job Shop Flexible Flow Shop Flexible Job Shop Generalisations: more than one machine of each type

Interactive scheduling system for machine

environments Useful for both research and teaching Graphical Interface Built in dispatching rules and simple heuristic methods User-defined algorithms can be added Developed at Stern School of Business, New York University + Columbia University The project has been directed by Professors M. Pinedo, X. Chao and J. Leung. Download (educational version): http://www.stern.nyu.edu/om/software/lekin up to 50 jobs, 100 machines, 20 work centres

Methods
Built-in Heuristics Dispatching Rules EDD (earliest due date), MS (minimum slack), LPT (longest processing time), SPT (shortest processing time), WSPT (weighted processing time) FCFS: (F)irst (C)ome (F)irst (S)erve CR : Critical Ratio rule Schedules jobs according to the ratio of the time left until the due date and the remaining processing time.
5

Shifting Bottleneck Heuristics Local Search Heuristic Hybrid Method: SB-LS: Combination of Shifting Bottleneck and Local Search heuristics

Prof S.Petrovic, School of Computer Science, University of Nottingham

Automated Scheduling

User-defined Heuristics Users can write new heuristics methods and use the plug-in feature Operate as external executables with standardised input and ouput parameters Allows researchers to test and develop new algorithms in an interactive environment. Facilitates comparison between various methods Makespan

Criteria
Cmax Tmax

Maximum Tardiness Total Number of Late Jobs Total Flow Time Total Tardiness Total Weighted Flow Time Total Weighted Tardiness

U C T w C
j j

w jT j

Graphical User Interface

Schedule

Job Pool Window Job statistics and settings

Machine Information

Job Information
9

Jobs

Sequence through machines and start and end 10 times for each machine

Sequence Window

Gantt Chart Window

Sequence of jobs through machine and start and end times

Jobs Machines (Work centres)

Machines (Work centres)

Time
11 12

Prof S.Petrovic, School of Computer Science, University of Nottingham

Automated Scheduling

Displaying schedules

Comparison between different schedules

Log of previous solutions

Various Solutions

Performance Criteria
13 14

Steps for generating a schedule

1. Enter Machine Information Number of Machines Availability Time Setup Time Information 2. Enter Job Information Number of Jobs Release Dates, Due Dates, Weight, and Route 3. Select a dispatching rule or heuristic and generate schedule

Examples
A single machine problem

jobs pj dj wj

1 10 4 14

2 10 2 12

3 13 1 1

4 4 12 12

15

16

Setting up the problem

4. For each job: Enter due date, processing time, and weight Click OK

1. Select single machine environment 2. Set number of machines (already set to 1) 3. Set number of jobs (4)
17 18

Prof S.Petrovic, School of Computer Science, University of Nottingham

Automated Scheduling

Environment display

Generated schedule

19

20

More solutions

EDD: (3214)

LPT: (3124)

J3

WSPT: J2 J1 J4
21

(4123)
22

Comparison between different schedules

EDD WSPT

23

LPT

24

Prof S.Petrovic, School of Computer Science, University of Nottingham

Automated Scheduling

A flow shop problem

Setting up the problem Machine (Workcenter) setup Establishing machine route for jobs

jobs p1j p2j p3j p4j

1 5 4 7 8

2 3 8 8 4

3 6 2 7 2

4 4 9 6 9

5 9 13 5 1

25

26

Schedule

Summary
Graphics based interactive machine shop scheduling system Ability to schedule a number of different machine environments Valuable as an educational and research tool Extendible with new heuristic techniques Manual Schedule Adjustment Large library of standard problems included in package Industrial version currently in development

27

28

Prof S.Petrovic, School of Computer Science, University of Nottingham