Scribd
Upload
73 views10 pages

IE 661 Scheduling Theory: Rakesh Nagi

This document summarizes key concepts from Chapter 2 of a scheduling theory textbook. It introduces notation for describing machine environments, processing characteristics, and objectives. Common single-machine and parallel-machine environments are defined, as well as processing constraints, common objectives like makespan and weighted completion time, and classes of schedules. Finally, it discusses complexity hierarchies for analyzing scheduling problems.

Uploaded by

bugoez
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
73 views10 pages

IE 661 Scheduling Theory: Rakesh Nagi

This document summarizes key concepts from Chapter 2 of a scheduling theory textbook. It introduces notation for describing machine environments, processing characteristics, and objectives. Common single-machine and parallel-machine environments are defined, as well as processing constraints, common objectives like makespan and weighted completion time, and classes of schedules. Finally, it discusses complexity hierarchies for analyzing scheduling problems.

Uploaded by

bugoez
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

IE 661

Scheduling Theory
Chapter 2

Rakesh Nagi
Department of Industrial Engineering
University at Buffalo (SUNY)

University at Buffalo (SUNY) Department of Industrial Engineering


Chapter 2: Deterministic Models
Preliminaries
z Processing time pij
z Release date rj
z Due date dj
z Weight wj
z Notation
| |
Machine environment
Processing characteristics and constraints
Objective

University at Buffalo (SUNY) Department of Industrial Engineering


Chapter 2: Deterministic Models
Preliminaries
z Machine environment
Single machine (1)
Identical machines in parallel (Pm)
Machines in parallel with different speeds (Qm)
Unrelated machines in parallel (Rm)
Flow shop (Fm) (m machines in series)
Flexible flow shop (FFc) (c stages with poss.
Identical machines)
Job shop (Jm) (recrc for recirculation in field)
Flexible job shop (FJc)
Open shop (Om) (scheduler can determine route)
University at Buffalo (SUNY) Department of Industrial Engineering
Chapter 2: Deterministic Models
Preliminaries
z Processing characteristics and constraints
Release dates (rj)
Sequence dependent setup times (sjk)
Machine specific sequence dependent setup times (sijk)
Premeptions (prmp)
Precedence constraints (prec)
Breakdowns (brkdwn)
Machine eligibility restrictions (Mj)
Permutation (prmu)
Blocking (block)
No-wait (nwt)
Recirculation (recrc)

University at Buffalo (SUNY) Department of Industrial Engineering


Chapter 2: Deterministic Models
Preliminaries
z Objective
Makespan (Cmax)
Max lateness (Lmax); Lj = Cj - dj
Total weighted completion time ( w C j j )
w (1 e
rC j
Discounted total weighted completion time ( j ))
Total weighted tardiness ( w T ) j j

Weighted number of tardy jobs ( w U j j )


z Examples
z Fm | pij = pj | w j C j

University at Buffalo (SUNY) Department of Industrial Engineering


Chapter 2: Deterministic Models
Preliminaries
z Classes of Schedules
Nondelay Schedule: A feasible schedule is called
non-delay if no machine is kept idle while an
operation is waiting for processing (i.e., it prohibits
unforced idleness).
A scheduling anomaly: Consider a P2 | prec | Cmax
with the following processing times

j 1 2 3 4 5 6 7 8 9 1
pj 8 7 7 2 3 2 2 8 8 0
1
5
University at Buffalo (SUNY) Department of Industrial Engineering
Chapter 2: Deterministic Models
Preliminaries

University at Buffalo (SUNY) Department of Industrial Engineering


Chapter 2: Deterministic Models
Preliminaries
z Classes of Schedules
Active Schedule: A feasible schedule is called active if it is
not possible to construct another schedule by changing the
order of processing on the machines and having at least one
operation finishing earlier and no operation finishing later.
Semi-active Schedule: A feasible schedule is called semi-
active if no operation can be completed earlier without
changing the order of processing on any one of the
machines.

Optimal
schedule
X Nondelay Active

Semi-Active
All schedules

University at Buffalo (SUNY) Department of Industrial Engineering


Chap 2

z Complexity
Hierarchy
1 || Cj
(reduces to)
1 || wj Cj
1 || wj Cj
Pm || wj Cj
Qm |prec| wj
Cj

University at Buffalo (SUNY) Department of Industrial Engineering


Chapter 2: Deterministic Models
Preliminaries
z Complexity hierarchy for Makespan (Fig. 2.8)
and Maximum Lateness problems (Fig. 2.9)

University at Buffalo (SUNY) Department of Industrial Engineering

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy