Prologue to Job Shop Scheduling Problem

Introduction to job shop scheduling problem l.jpg
1 / 16
0
0
1019 days ago, 375 views
PowerPoint PPT Presentation
Depiction of Job Shop Scheduling. A limited arrangement of n jobsEach occupation comprises of a chain of operations A limited arrangement of m machinesEach machine can deal with at most one operation at a timeEach operation should be handled amid a continuous time of a given length on a given machinePurpose is to discover a timetable, that is, an assignment of the operations to time interims to machines, that has mi

Presentation Transcript

Slide 1

´╗┐Prologue to Job Shop Scheduling Problem Qianjun Xu Oct. 30, 2001

Slide 2

Description of Job Shop Scheduling A limited arrangement of n occupations Each employment comprises of a chain of operations A limited arrangement of m machines Each machine can deal with at most one operation at once Each operation should be prepared amid a continuous time of a given length on a given machine Purpose is to discover a calendar, that is, an assignment of the operations to time interims to machines, that has negligible length

Slide 3

Formal Definition of JSS Job set Machine set Operations Each operation has handling time On O characterize An, a twofold connection speak to a priority between operations. In the event that then v must be performed before w. An incite the aggregate requesting having a place with a similar occupation; no priority exist between operations of various employments.

Slide 4

Formal Definition of JSS cont. A calendar is a capacity that for every operation v characterizes a begin time S(v). A calendar S is practical if The length of a timetable S is The objective is to locate an ideal calendar, a plausible timetable of least length., min(len(S)).

Slide 5

Disjunctive Graph An occasion of the JSS issue can be spoken to by method for a disjunctive diagram G=(O, An, E). The vertices in O speak to the operations The circular segments in A speak to the given priority between the operations The edge in represent the machine limit limitations Each vertex v has a weight, equivalent to the handling time

Slide 6

Example of Disjunctive Graph

Slide 7

Disjunctive Graph with Edge Orientations

Slide 8

Disjunctive Graph Cont. Finding an ideal possible timetable is identical to finding an introduction E' that limits the longest way length in the related digraph.

Slide 9

Why JSS Problem It is thought to be a decent portrayal of the general area and has earned a notoriety for being famously hard to understand JSS is considered to have a place with the class of choice issues which are NP Lenstra et al(1977) Show that 3*3 issue N*2 occurrence without any than 3 operations for each occupation N*3 issue without any than 2 operations for every employment N*3 issue where all operations are of unit preparing time Belong to the arrangement of NP cases.

Slide 10

Methods to Solve JSS Mathematical Formulations: blended whole number direct programming (1960) Branch and Bound Approximation Methods Priority dispatch rules Bottleneck based heuristics Artificial intelligence(constraint fulfillment approach, neural systems) Local hunt techniques

Slide 11

Branch and Bound Using a powerfully developed tree structure speaks to the arrangement space of every attainable grouping Search starts at highest hub and an entire choice is accomplished once the most reduced level hub has been assessed Each hub at a level p in the pursuit tree speak to an incomplete succession of p operations From an unselected hub the expanding operation decides the following arrangement of conceivable hubs from which the inquiry could advance The jumping strategy chooses the operation which will proceed with the inquiry and depends on an expected LB and at present best accomplished UB. On the off chance that at any hub the evaluated LB is observed to be more noteworthy than the present best UB, this halfway determination and all its consequent relatives are neglected.

Slide 12

Priority Dispatch Rules At each progressive stride every one of the operations which are accessible to be planned are doled out a need and the operation with the most elevated need is been sequenced. Generally a few keeps running of PDRs are made so as to accomplish substantial outcomes.

Slide 13

Constraint Satisfaction Approach Aiming at diminishing the compelling size of the pursuit space by applying imperatives that limit the request in which factors are chosen and the succession in which conceivable qualities are appointed to every variable Constraint proliferation Backtracking Variable heuristic Value heuristic

Slide 14

Neural Networks Hopfield arranges Back-mistake spread systems

Slide 15

Local Search Method Configurations: a limited arrangement of arrangements. Taken a toll capacity to be streamlined. Era component, producing a move starting with one design then onto the next. Neighborhood, N(x), is a capacity which characterizes a basic move from an answer x to another arrangement by inciting a change. Choice of neighborhood: picked the main lower cost neighbor found; select the best neighbor in the whole neighborhood; Choose the best of an example of neighbors.

Slide 16

Summary The meaning of JSS The disjunctive chart The techniques to settle JSS

SPONSORS