• Nenhum resultado encontrado

Patent US

N/A
N/A
Protected

Academic year: 2022

Share "Patent US"

Copied!
43
0
0

Texto

(1)

U.S.C. 154(b) by 188 days. 2008/0215408 A1* 9/2008 Pachon et a1. .. 705/8 2009/0070158 Al* 3/2009 Virine et a1. 705/7 (21) APPLNQ; 13/046,346 2009/0113442 A1* 4/2009 Deidda et a1. .. 718/105

2009/0228129 A1 * 9/2009 Moyne et a1. .... .. 700/l02

. _ 2009/0234482 A1 * 9/2009 Ide ... .. 700/l00

(22) Flied- Ma“ 11’ 2011 2010/0114353 A1 * 5/2010 Domrose 700/100

_ _ _ 20ll/0ll2676 Al * 5/20ll IZumi ... .. 700/l0l

(65) Prior Publication Data 2011/0166688 A1* 7/2011 Moyne et a1. ... .. 700/104

Reiated U-s- Application Data Primary Examiner * Ramesh Patel

(60) Provisional application No. 61/313,210, ?led on Mar. (74) A110" "6% A8611!) 01’ Firm *Poiomac Patent Group

12, 2010. PLLC

(51) Int. Cl. (57) ABSTRACT

G06F 19/00 (201101) Computerized scheduling methods and computerized sched

G06Q 10/00 (2012.01) ul1ng systems accord1ng to exemplary embod1ments. A . . . com

(52) US. Cl. puter1Zed schedul1ng method may be stored 1n a memory and - - -

USPC ... .. 700/100; 700/95; 700/96; 700/99; executed on one or more processors. The method may include

700/102; 700/104; 705/7'12; 705/7'13 de?ning a main multi-machine scheduling problem as a plu (58) Fieid 0f Classi?cation Search rality of single machine scheduling problems; independently

USPC ~~~~~~ ~~ 700/ 99*1 04; 705/ 712*713, 722*728; solving the plurality of single machine scheduling problems _ _ 7i 8/1 0&1 04 thereby calculating a plurality of near optimal single machine See aPPiiCaiiOii iiie for Coiiipiate Search history scheduling problem solutions; integrating the plurality of _ near optimal single machine scheduling problem solutions (56) References Cited into a main multi-machine scheduling problem solution; and Us PATENT DOCUMENTS putputting the main multi-machine scheduling problem solu

1on.

4,858,147 A * 8/1989 ConWell ... .. 706/19

5,155,679 A * 10/1992 Jain et a1. ... .. 700/106 27 Claims, 34 Drawing Sheets

BE§§1EEW$BL3Q§ETSY°3FEZ1U11L£E A‘

MACHlNE SCHEDULING PROBLEMS

FOR axon SMSP, muss DATESAND DUE 55a

1 11120111111511211111151250

RELEASETIMES lNDEPENDENTLV SOLVE THE PLURAUTY OF /5D6

$111015 mums SCHEDULING PROBLEMS

(2)

M3382 wzzzawIow

ozawmooml

mil

(3)

FIG.

2

(4)

PARAMETER DEFINITION

SCHEDULING REPORT

PLANNED/REAL SCHEDULING COMPARISON

JOBS TARDINESS COMPARISON JOBS WEIGHT

COMPARISON COMMUNICATION

GUI WITH THE SYSTEM

VISUALIZATION OF THE RESULTS

(EXTENDS)

SCHEDULING GANTT CHART

(5)

204

AGENTJOB AGENTRESOURCE

OPERATIONS’

DISTRIBUTION BY THEIR AGENTSRESOURCE

SOLUTIONS COMMUNICATION TO

AGENTUI

FIG. 4

(6)

DEFINE MAIN JOB SHOP SCHEDULING PROBLEM AS A PLURALITY OF SINGLE MACHINE SCHEDULING PROBLEMS

/504

V

INDEPENDENTLY SOLVE THE PLURALITY OF SINGLE MACHINE SCHEDULING PROBLEMS

/506

V

INTEGRATE THE PLURALITY OF SINGLE MACHINE SCHEDULING PROBLEMS

/508

V

OUTPUT SINGLE MAIN JOB SHOP SCHEDULING PROBLEM SOLUTION

END 512

(7)

V

FOR EACH SMSP, RELEASE DATES AND DUE

DATES DETERNINED BASED ON INPUTTED /558 OPERATION DUE DATES AND INPUTTED

RELEASETINES

"1

EACH SMSP SOLvED INDEPENDENTLY USING /560 TABU SEARCH ORA GENETIC ALGORITHM

V

INTEGRATE SOLUTIONS TO FIND SOLUTION TO /562 EJSSP

566

/

REPAIRING MECHANISM

(8)

1:1 MASDScheGATS EHEHXT

?le Miew ?elp

\{Iome |(\Machines |[\Jobs If Operattons If Jobs List If Schedultngtype If System Communtcation If Output |

698 699 601 Jobs

lnserttob Id Ret_dt Due_dt Weight

J1 5 24 1

10W‘ ‘El/602 J2 0 18 2

Release Date: U604 J3 0 16 2

-DUB Date: j

@610

Delete Job

Select the Job to be deteted 612

616 618

L / I)

/ LastActton: Job J3 added viewHtstoryn.

I / 101

(9)

El MASDScheGATS EJE1®

Eile yiew ?eip

Home Machines Jobs /Operations |( Jobs List If Scheduling Type If System Communication [Output | 701

Machines that perform the job

Operationsinanager --- -- Machine lme

Seleotjob 708 716

F v New Operation ID: I? a‘ktl

702 706 704 pp

Operations List / M12

iii 710 M1 718

722 l 7

Select the Operation to be deleted 712 Ill 714

L i

/ Last Action: Operation J1 i added to the Job it View History".

101

(10)

El MASDScheGATS EJEJQ]

Eile yiew ?elp

Horne Machines Jobs Operations If Jobs List [Scheduiing Type If System Communication Ii Output |

Operations Manager Seiectiob:

IE v New Operation ID: IZI 724

s

Enter operation’s duration:

Operations List JM W

726

Select the Operation to be deieted ‘El

/ Last Action: Operation ii i added to the Job it View History.“

r

101

(11)

iIi MASDScheGATS [§]@@

Eiie yiew ?elp

[ Home [ Machines [Jobs [ Operations If Jobs List If SoneduiingTppe [System Communication If Output |

Previous Operations

Operations Manager m

Seleotjob: 730

Ill v New Operation ID: III @

Previous Operations m

Operations List

iii 732

r r

Select the Operation to be deleted 726 El 728

p

/ iastAotion: Operationii i added to the iobit ilievrrHistorym

r / 101

(12)

U MASDScheGATS [BEEF Eile yiew ?elp

(Home If Macldnes If Jobs If Operadons If Jobs 11st If SchedulingType lfSystem Commumcadon If Output |

‘N

E?éslelxml tarefas

1001

Jobs

W1 002

ViewOperations 1’ 1004

@1006

Last Action: Operation J4 9 added to the job J4 V1ewH1storyH.

(13)

El Operations’ Graph (Job: J1) k [Q [E $1 EJEJgy

LastAcdon: Operation J43 added to the Job J4 View History...

(14)

'5 MASDScheGATS gi?igi‘

Eile Miew ?elp

(Home |( Machines If Jobs |( Operations If Jobs List |(\SoheduiingType If System Communication If Output | 1201

GenetioAlgoritnm

- 1210

Schedulmg Type Population size %

Seleotthesoheduiingtype .. . . 1212

lnrtral lndrvrduai

GenetioAlgorithm 1202 1214

Tabu Search 1204 Initial Population’s Generator %

Integration Mechanism @1206 K Objective Function @016

1218

Re-Soheduling Type a 1208 Crossover Rate %

1220 Mutation Rate %

r 1222

Generations number :l/

@1224

A

/ tastAotion: Fiie example and loaded View History...

I 101

(15)

D MASDScheGATS EHEIXT Elle yiew ?elp

(Home If Machines lflobs If Operations If Jobs List If Schedulingippe [System Communication If Output |

Tabu Search

Scheduling Tree lnitial Solution @1302

. 1 4

Select the scheduling type Neighborhood Generator U 30

Genetic Algorithm 1202 1306

Tabu Search 1204 Tabu list length mil/

- - - 1308

integration Mechanism ‘EB/1206 Oblectlve Function Mfg“) its-Scheduling Tune 1208 SubNeighborhood M

Stopping Criteria @rumber)

1312

@1314

A

/ last Action: File example and loaded View History“.

r I 101

(16)

U MASDScheGATS ENENE‘

Eile yiew ?elp

(Home If Machines lfiobs [Operations [Jobstist [ScneduiingTyoe |F\System Communication [Output

1401

Communication with the System

Start Processing 1402 1404

1406

A

/ Last Action: Processing completed View History.“

| /

(17)

'5 MASDScheGATS [511E118 Eiie Miew ?eip

[Home |r Machines lftobs If Operations |( Jobs List If Schedulingiype Ii System Communication |[Output\

is 1501

Graphic Mode

-Operations Scneduiing

Scneduiing by Machine 1502 Comparations/Reiations 1504 Pianned/ReaiScheduiing /

Jobs’ Weight /1506 Jobs‘ Tardiness /1508 Text Mode

Scheduling Report 1510

4

/ Last Action: Processing completed View History.“

/ 101

(18)

'Ei MASDScheGATS EIEET

Eile yiew ?elp

1 Home If Machines Ii Jobs In Operations If Jobsiisi If Soheduiing Type If System Communication l1 Output 1602

\

Graphic Mode Scheduling Plan

-Operaiions Sohedniing Time

schedunngbymachme 10001 10002 10003 10004 10005 10006 10007 10008 10009 10010 10011

Comparations/Reiations

PiannediReaiSoheduiing M3 Jobs’Weighi

Jobs’iardiness

Textiiiode I gm

Soneduling Report <2“

M1

1604 BJ2EJ3E1J4EIJ1

\ Simulation Speed 0 2X kc» 10X 0 100x

4 i Pause Stop I“ Play |

/ Last Action: Processing oompieted View History“.

I / 101

(19)

1702

'El‘llASDScheGATS \ 1704 gl?lgl‘

518109010201 ______ __ \

(H—o Sc_h_edgl|_ng _____ __ vby'Machinelobstist If Schedulinglype [System Communication [Output |

Scheduling Report %

Comparative Relations >

Graphic Mode Scheduling Plan

-0peratlons Scheduling Time

scheduimgbyMachine 10007 10008 10009 10010 10011 10012 10013 10014 10015 10016 10017

ComparationslRelatlons

Planned/Real Scheduling M3

lobstWeignt

Jobs’ Tardiness Textlllode

Scheduling Report M2

M1

E02 5031104 E101

Simulation Speed 0 2x @ 10x 0 100x

Pause | Stop Play |

/ Last Action: Processing completed View History...

I r

101

(20)

1602

D Scheduling by Machine E1E1® gl?ngf

Scheduling Plan

% Time mCommunication If Output |

10000 10005 10010 10015 10020 10025 10030 10035

003 I I Plan

me

012 10013 10014 10015 10016 10017

g 02

M1

H02 H03 11104 E01

M1

E102 H03 1104 B01

S1mu1ation Speed 0 2x @ 10x 0 100x

1 Pause Stop Play 1

/ LastAction: Processing completed viewHistorxn

/ I

101

(21)
(22)
(23)
(24)
(25)
(26)
(27)
(28)
(29)
(30)
(31)
(32)
(33)
(34)
(35)
(36)
(37)
(38)
(39)
(40)
(41)
(42)
(43)

Referências

Documentos relacionados

Com o desenvolvimento de novos materiais e novas técnicas de manufatura, as juntas coladas passaram a ser mais utilizadas devido a algumas vantagens sobre as tradicionais

Estamos realizando uma pesquisa para elaboração de Trabalho de Conclusão do Curso de Graduação em Biblioteconomia da Universidade Federal da Paraíba, assim sendo o

O percurso de investigação nos leva do cenário da composição das políticas públicas curriculares para a maestria da atividade docente. Procurar nos relatos dos professores

O Estado de Santa Catarina possui aproximadamente 1.259.081 hectares de formações naturais campestres. Esse ecossistema apresenta uma alta diversidade de espécies

- dados específicos sobre o desempenho do trabalho do técnico na empresa, base para a disseminação seletiva da informação.. c) grupo de perguntas para coleta de dados avaliativos

2005 registraram valores variando entre 18 e 54 espécies para rios de porte mais elevado que os trabalhados nesta pesquisa, o que é naturalmente aceito, pois segundo o autor

Iniciando a análise dos resultados presentes na Tabela 3 por meio do que ocorre com a variável raça/cor, é possível notar semelhanças com as descritivas no sentido de

Por fim, a análise da relação, o nível dos países que integram o continente africano, entre os indicadores que foram utilizados para quantificar o turismo