General Scheduling Model and
|
|
- Ralph Joseph
- 6 years ago
- Views:
Transcription
1 General Scheduling Model and Algorithm Andrew Kusiak 2139 Seamans Center Iowa City, Iowa Tel: Fax: MANUFACTURING SCHEDULING n Jobs (Operations) m Machines + other resources MPS MRP Balancing Scheduling Scheduling Data No of operations Processing time Precedence constraints Due time Scheduling Algorithm Schedule
2 Example M M M Time What type of schedule is it - jobshop or flowshop? Scheduling Model: m Machines and n Operations n = of parts m = of machines Ri = set of pairs of operations [k, l] for part Pi, where operation k precedes operation l, i = 1,..., n Qi = set of pairs of operations [k, l] for part Pi, where k and l can be performed in any order, i = 1,..., n Ii = set of operations without precedence constraints, i = 1,..., n. Np = set of operations to be performed on machine p, p = 1,..., m ni = of operations in part Pi, i = 1,..., n til = processing time of operation l of part Pi, l = 1,..., n, i = 1,..., n M = an arbitrary large positive
3 xik = completion time of operation k of part Pi, k = 1,..., n, i = 1,..., n x[i] = completion time of the final operation of part Pi, i = 1,..., n ykl = { 1 if operation k precedes operation l 0 otherwise for all [k, l] Qi, i = 1,..., n. zkl = { 1 if operation k precedes operation l 0, otherwise for all [k, l] Np, p = 1,..., m Basic Notation Part ti: Operations k, l,... Precedence constraints Completion time k xik l xil Part j
4 The Model n Min x[i] Min the total completion time i =1 subject to: xil - xik til for all [k, l] Ri, for all i Operations k and l of part i are processed according to the precedence required Schedule Part ti k k xik l til l xil Time xil - xik + M(1- ykl ) xik - xil + Mykl tik til for all [k, l] Qi for all i Two operations of part i can not be processed at the same time TWO POSSIBILITIES (Same part) Part i k l OR l k k til l xik xil xil l tik k xik Time
5 xjl - xik + M(1- zkl ) tjl for all [k, l] Np for all p xik - xjl + Mzkl tik i j where Np = Set of operations to be performed on machine p A machine can not process more than one part at the same time TWO POSSIBILITIES (Different parts) Part i Part j Part j Part i OR k til l xik xjl xjl l tik k xik Time tik xik { for [i, k ] Ii, i =1,..., n 0 for all other i, k Part i tik k xik Time For operations without precedence constraints ykl = 0, 1 for all [k, l] Qi, for all i zkl = 0, 1 for all [k, l] Np, for all p
6 !!!! Go over this model at least twice! Example Structure of Three Parts Part P 1 1, 1 1, 2 1, 3 Part P 2 2, 1 2, 2 Part P , 3, 3 3, 2
7 Scheduling Data Part Operation Machine Processing time LINDO Input File MIN Part P 1 1, 1 Part P 2 1, 2 1, 3 X13+X21+X22+X33 SUBJECT TO X12-X11 >= 5 X13-X12 >= 6 X33-X31 X31 >= 7 2, 1 2, 2 X33-X32 >= 7 Part P 3 Operations of part i are processed according to the precedence required xil - xik til 3, 1 3, 2 3, 3 Derived from X22-X (1-Y1) >= 4 X21-X22+999Y1 >= 8 X22-X21-999Y1 >= -995 X31-X32+999Y2 >= 9 X32-X31-999Y2 >= -997 Two operations of the same part i can not be processed at the same time xik - xil + Mykl tik xil - xik + M(1- ykl) til
8 Part Operation Machine Processing time X11-X21+999Z1 >= 3 X21-X11-999Z1 >=-991 X11-X32+999Z2 >= 3 X32-X11-999Z2 >= -997 X12-X21+999Z3 >= 5 X21-X12-999Z3 >= -991 X12-X32+999Z4 >= 5 X32-X12-999Z4 >= -997 A machine can not process more than one part at the same time xik - xjl+ Mzkl tik xjl - xik + M(1- zkl) tjl X21 - X Z5 >= 8 X32 - X21-999Z5 >= -997 Part Operation Machine Processing time X13-X22+999Z6 >= 6 X22-X13-999Z6 >= -995 X13-X31+999Z7 >= 6 X31-X13-999Z7 >= -990 X13-X33+999Z8 >= 6 X33-X13-999Z8 >= -992 X22-X31+999Z9 X31+999Z9 >= 4 X31-X22-999Z9 >= -990 X22-X33+999Z10 >= 4 X33-X22-999Z10 >= -992 A machine can not process more than one part at the same time xjl - xik + M(1- zkl) xik - xjl+ Mzkl tik tjl
9 X11 >= 3 X21 >= 8 X22 >= 4 X31 >= 9 X32 >= 2 END Operation finish time not smaller than its processing time INTEGER Y1 INTEGER Y2 INTEGER Z1 INTEGER Z2 INTEGER Z3 INTEGER Z4 INTEGER Z5 INTEGER Z6 INTEGER Z7 INTEGER Z8 INTEGER Z9 INTEGER Z10
10 The Optimal Schedule x32 = 2, x21 = 12, x11 = 15, x12 = 20, x22 = 4, x31 = 13, x33 = 20, and x13 = 26 M 1 3,2 2,1 1,1 1, M 2 0 2,2 3,1 3,3 1, Time Scheduling Model with Multiple Resources m = of resource types rs = of resources of type s, s = 1,..., m d[i] = due date of part i Nq = set of operations using resource q, q = 1,..., rs, s = 1,..., m n min x[i] i=1 subject to: xil - xik til for all [k, l] Ri, for all i xil - xik + M(1- ykl ) til for all [k, l] Qi xik - xil + Mykl tik for all i
11 xjl - xik + M(1- zkl ) tjl for all [k, l] Nq, for all q, xik - xjl + Mzkl x[i] tjl i j d[i] for all i tik for [i, k] Ii, i = 1,..., n xik { 0 for all other i, k ykl = 0, 1 for all [k, l] Qi, for all I zkl = 0, 1 for all [k, l] Nq, for all q Example Structure of Three Parts Part P 1 1, 1 1, 2 Part P 2 2, 1 2, 2 Part P 3 3, 1 3, 2 3, 3
12 Scheduling Data Part Operation Machine Processing time Tool The Optimal Schedule with Limited Number of Tools M 1 (1) (2) (2) (2) 1, 1 2, 2 3, 1 3, 3 M 2 0 (2) (1) (1) 2, 1 1, 2 3, C 3= Time (k) i, j Operation j of uses tools k
13 The Optimal Schedule with Unlimited Number of Tools M 1 (1) (2) (2) (1) (2) 1, 1 2, 1 2, 2 3, 2 3, 3 M 2 0 (2) (1) 3, 1 1, C' = Time Two copies of tool 1 and 2 are needed. Definition General Scheduling Heuristic Part P with 6 operations An operation is schedulable at time t if the following three conditions are satisfied: No other operation that belongs to the same part is being processed at the time t. All operations preceding the operation considered have been completed before the time t. All resources (for example, machines, tools, fixtures) required for performing the operation are available at the time t.
14 Two Scheduling Scenarios No single operation is schedulable (a deadlock) Many operations are schedulable hdlbl How to select the most promising operations? PRIORITY RULES
15 Definitions Part P with 6 operations Operations 3, 4, 5, and 6 are successive operations of operation 2 Operations 3 and 4 are immediate successive operations of operation 2 General Heuristic Step 1. Initialize: Current time Set of schedulable operations Set of completed operations Step 2. From the set of schedulable operations, select an operation using the following priority rules: P1: with the largest of successive operations P2: belonging to a part with the minimum of schedulable operations P3: with the largest of immediate successive operations P4: belonging to a part with the largest of unprocessed operations P5: with the shortest processing time P6: belonging to a part with the shortest slack time.
16 P7: arbitrary choice Step 3. Schedule the operation selected in step 2. Update: The resource status The set of schedulable operations If the set of schedulable operations is empty, go to step 4; otherwise, go to step 2. Step 4. Calculate the completion time of each operation scheduled but not completed at the current time. Set the current time equal to the completion time of the operation with the least remaining processing time. Add this operation (or operations in case of a tie) to the set of completed operations. Update: The resource status The set of schedulable operations If there is no unprocessed operations, stop; otherwise, go to step 5. Step 5. If the set of schedulable operations is empty, go to step 4; otherwise go to step 2.
17 Heuristic Structure Determine Schedulable Set Operation with no precedences Operation belongs to a part being not-processed Manufacturing resources available Use Priority Rules: P1 - P7 Schedule an operation no Update Current time, machine status, part status All operations are scheduled yes End Priority Rules: P1 - P7 Schedulable Set >1 operations P1 >1 operations P2 >1 operations P3 >1 operations P4 >1 operations P5 >1 operations P6 >1 operations P7 One Operation Selected Arbitrary select 1 operation
18 Part P 1 Priority Rule P6: Min slack time 1 2 Part P M tp2 sp2 dp2 M tp3 sp3 dp3 12 Time Part P Slack = Due time - Current time Example Part P Part P Three Parts Part P
19 Scheduling Data Part P Part P Part P 3 Part Operation Machine Machining time Iterations of the Heuristic Step 1. Initialize: Current time t = 0 The set of schedulable operations S1 = {13467} {1, 3, 4, 6, The set of completed operations F = Ø P1: with the largest of successive operations P2: belonging to a part with the minimum of schedulable operations P3: with the largest of immediate successive operations P4: belonging to a part with the largest of unprocessed operations P5: with the shortest processing time P6: belonging to a part with the corresponding shortest slack time. Step 2. Using rule P1, operations 1, 3, 4, 7 have been selected. Priority rule P2 selects operation 1. Step 3. Operation 1 is scheduled on machine 1. Part P Part P M Time Part P
20 Step 4. Operations status update Scheduled operation Same machine as operation 1 8 P1: with the largest of successive operations P2: belonging to a part with the minimum of schedulable operations P3: with the largest of immediate successive operations P4: belonging to a part with the largest of unprocessed operations P5: with the shortest processing time P6: belonging to a part with the corresponding shortest slack time. Part Operation Machine Machining time The set of schedulable operations is updated to S1 = {3, 6}. Go to step 2. Step 2. Rule P1 selects operation 3 from S1 = {3, 6}. Step 3. Operation 3 is scheduled on machine 2. M1 1 M P1: with the largest of successive operations P2: belonging to a part with the minimum of schedulable operations P3: with the largest of immediate successive operations P4: belonging g to a part with the largest of unprocessed operations P5: with the shortest processing time P6: belonging to a part with the corresponding shortest slack time. Part Operation Machine Machining time The set of schedulable operations is updated to S1= Ø. Go to step 4.
21 Step 4. The completion time of operations 1 and 3 is 4 and 3, respectively, and current time is set to 3. Operation 3 is added to the set of completed operations F, F = {3}. Machine 2 becomes available and its status has been updated. The set of schedulable operations is updated to S1= {6}. Go to step 5. M1 M2 1 3 Time t=3 Part Part Operation Machine Machining time Step 5. Since the set of schedulable operations S1={6} Ø, go to Step 2. Step 2. Operation 6 is selected. Step 3. Operation 6 is scheduled on machine M1 1 Time t=4 M2 3 6 M1 1 M2 3 6 Time t= Part Operation Machine Machining time The set of schedulable operations S1={4} Ø. Step 2. Operation 4 is selected. Step 3. Operation 4 is scheduled on machine 1. M1 1 4 M2 3 6 Time t=6
22 The Final Schedule Part Part Operation Machine Machining time M M The makespan = 10 Time
Lecture 4 Scheduling 1
Lecture 4 Scheduling 1 Single machine models: Number of Tardy Jobs -1- Problem 1 U j : Structure of an optimal schedule: set S 1 of jobs meeting their due dates set S 2 of jobs being late jobs of S 1 are
More informationOutline. Page 1. Big Picture LAYOUT EXAMPLES LAYOUT OF MACHINES AND FACILITIES
Andrew Kusiak, Professor Industrial Engineering 9 Seamans Center Iowa City, Iowa - 7 LAYOUT OF MACHINES AND FACILITIES Tel: 9-9 Fax: 9-669 andrew-kusiak@uiowa.edu http://www.icaen.uiowa.edu/~ankusiak Outline
More informationDynamic Scheduling with Genetic Programming
Dynamic Scheduling with Genetic Programming Domago Jakobović, Leo Budin domago.akobovic@fer.hr Faculty of electrical engineering and computing University of Zagreb Introduction most scheduling problems
More informationPartition is reducible to P2 C max. c. P2 Pj = 1, prec Cmax is solvable in polynomial time. P Pj = 1, prec Cmax is NP-hard
I. Minimizing Cmax (Nonpreemptive) a. P2 C max is NP-hard. Partition is reducible to P2 C max b. P Pj = 1, intree Cmax P Pj = 1, outtree Cmax are both solvable in polynomial time. c. P2 Pj = 1, prec Cmax
More informationSingle Machine Models
Outline DM87 SCHEDULING, TIMETABLING AND ROUTING Lecture 8 Single Machine Models 1. Dispatching Rules 2. Single Machine Models Marco Chiarandini DM87 Scheduling, Timetabling and Routing 2 Outline Dispatching
More informationAn improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint J. Breit Department of Information and Technology Management, Saarland University, Saarbrcken, Germany
More informationA Semiconductor Wafer
M O T I V A T I O N Semi Conductor Wafer Fabs A Semiconductor Wafer Clean Oxidation PhotoLithography Photoresist Strip Ion Implantation or metal deosition Fabrication of a single oxide layer Etching MS&E324,
More informationScheduling with Advanced Process Control Constraints
Scheduling with Advanced Process Control Constraints Yiwei Cai, Erhan Kutanoglu, John Hasenbein, Joe Qin July 2, 2009 Abstract With increasing worldwide competition, high technology manufacturing companies
More informationPlanning and Scheduling of batch processes. Prof. Cesar de Prada ISA-UVA
Planning and Scheduling of batch processes Prof. Cesar de Prada ISA-UVA prada@autom.uva.es Outline Batch processes and batch plants Basic concepts of scheduling How to formulate scheduling problems Solution
More informationAlgorithm Design Strategies V
Algorithm Design Strategies V Joaquim Madeira Version 0.0 October 2016 U. Aveiro, October 2016 1 Overview The 0-1 Knapsack Problem Revisited The Fractional Knapsack Problem Greedy Algorithms Example Coin
More informationHYBRID FLOW-SHOP WITH ADJUSTMENT
K Y BERNETIKA VOLUM E 47 ( 2011), NUMBER 1, P AGES 50 59 HYBRID FLOW-SHOP WITH ADJUSTMENT Jan Pelikán The subject of this paper is a flow-shop based on a case study aimed at the optimisation of ordering
More informationSTABILITY OF JOHNSON S SCHEDULE WITH LIMITED MACHINE AVAILABILITY
MOSIM 01 du 25 au 27 avril 2001 Troyes (France) STABILITY OF JOHNSON S SCHEDULE WITH LIMITED MACHINE AVAILABILITY Oliver BRAUN, Günter SCHMIDT Department of Information and Technology Management Saarland
More informationNAM weather forecasting model. RUC weather forecasting model 4/19/2011. Outline. Short and Long Term Wind Farm Power Prediction
Short and Long Term Wind Farm Power Prediction Andrew Kusiak Intelligent Systems Laboratory 2139 Seamans Center The University of Iowa Iowa City, Iowa 52242 1527 andrew kusiak@uiowa.edu Tel: 319 335 5934
More informationP C max. NP-complete from partition. Example j p j What is the makespan on 2 machines? 3 machines? 4 machines?
Multiple Machines Model Multiple Available resources people time slots queues networks of computers Now concerned with both allocation to a machine and ordering on that machine. P C max NP-complete from
More informationSINGLE MACHINE SEQUENCING Part 2. ISE480 Sequencing and Scheduling Fall semestre
SINGLE MACHINE SEQUENCING Part 2 2011 2012 Fall semestre Minimizing Total Weighted Flowtime In a common variation of the F-problem, obs do not have equal importance. One way of distinguishing the obs is
More informationComplexity analysis of job-shop scheduling with deteriorating jobs
Discrete Applied Mathematics 117 (2002) 195 209 Complexity analysis of job-shop scheduling with deteriorating jobs Gur Mosheiov School of Business Administration and Department of Statistics, The Hebrew
More informationThe University of Iowa Intelligent Systems Laboratory The University of Iowa. f1 f2 f k-1 f k,f k+1 f m-1 f m f m- 1 D. Data set 1 Data set 2
Decomposition in Data Mining Basic Approaches Andrew Kusiak 4312 Seamans Center Iowa City, Iowa 52242 1527 andrew-kusiak@uiowa.edu http://www.icaen.uiowa.edu/~ankusiak Direct mining of data sets Mining
More informationSingle Machine Problems Polynomial Cases
DM204, 2011 SCHEDULING, TIMETABLING AND ROUTING Lecture 2 Single Machine Problems Polynomial Cases Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline
More informationA polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint
A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint Joachim Breit Department of Information and Technology Management, Saarland University,
More informationRCPSP Single Machine Problems
DM204 Spring 2011 Scheduling, Timetabling and Routing Lecture 3 Single Machine Problems Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. Resource
More informationFlow Shop and Job Shop Models
Outline DM87 SCHEDULING, TIMETABLING AND ROUTING Lecture 11 Flow Shop and Job Shop Models 1. Flow Shop 2. Job Shop Marco Chiarandini DM87 Scheduling, Timetabling and Routing 2 Outline Resume Permutation
More informationA CRITICAL-MACHINE BASED HEURISTIC FOR HFS BATCH SCHEDULING
International Journal of Mechanical Engineering and Technology (IJMET) Volume 9, Issue 8, August 2018, pp. 105 119, Article ID: IJMET_09_08_012 Available online at http://www.iaeme.com/ijmet/issues.asp?jtype=ijmet&vtype=9&itype=8
More informationMulti-Objective Scheduling Using Rule Based Approach
Multi-Objective Scheduling Using Rule Based Approach Mohammad Komaki, Shaya Sheikh, Behnam Malakooti Case Western Reserve University Systems Engineering Email: komakighorban@gmail.com Abstract Scheduling
More informationMinimizing the weighted completion time on a single machine with periodic maintenance
Minimizing the weighted completion time on a single machine with periodic maintenance KRIM Hanane University of Valenciennes and Hainaut-Cambrésis LAMIH UMR CNRS 8201 1st year Phd Student February 12,
More informationSingle machine scheduling with forbidden start times
4OR manuscript No. (will be inserted by the editor) Single machine scheduling with forbidden start times Jean-Charles Billaut 1 and Francis Sourd 2 1 Laboratoire d Informatique Université François-Rabelais
More informationEECS 571 Principles of Real-Time Embedded Systems. Lecture Note #7: More on Uniprocessor Scheduling
EECS 571 Principles of Real-Time Embedded Systems Lecture Note #7: More on Uniprocessor Scheduling Kang G. Shin EECS Department University of Michigan Precedence and Exclusion Constraints Thus far, we
More information4 Sequencing problem with heads and tails
4 Sequencing problem with heads and tails In what follows, we take a step towards multiple stage problems Therefore, we consider a single stage where a scheduling sequence has to be determined but each
More informationApproximation Algorithms for scheduling
Approximation Algorithms for scheduling Ahmed Abu Safia I.D.:119936343, McGill University, 2004 (COMP 760) Approximation Algorithms for scheduling Leslie A. Hall The first Chapter of the book entitled
More informationInstance Selection. Motivation. Sample Selection (1) Sample Selection (2) Sample Selection (3) Sample Size (1)
Instance Selection Andrew Kusiak 2139 Seamans Center Iowa City, Iowa 52242-1527 Motivation The need for preprocessing of data for effective data mining is important. Tel: 319-335 5934 Fax: 319-335 5669
More informationMinimizing Class-Based Completion Time Variance on a Single Machine
Minimizing Class-Based Completion Time Variance on a Single Machine Xueping Li Yuerong Chen University of Tennessee Yang Sun Arizona State University Outline Background & motivation Introduction to CB-CTV
More informationData Mining. Preamble: Control Application. Industrial Researcher s Approach. Practitioner s Approach. Example. Example. Goal: Maintain T ~Td
Data Mining Andrew Kusiak 2139 Seamans Center Iowa City, Iowa 52242-1527 Preamble: Control Application Goal: Maintain T ~Td Tel: 319-335 5934 Fax: 319-335 5669 andrew-kusiak@uiowa.edu http://www.icaen.uiowa.edu/~ankusiak
More informationLPT rule: Whenever a machine becomes free for assignment, assign that job whose. processing time is the largest among those jobs not yet assigned.
LPT rule Whenever a machine becomes free for assignment, assign that job whose processing time is the largest among those jobs not yet assigned. Example m1 m2 m3 J3 Ji J1 J2 J3 J4 J5 J6 6 5 3 3 2 1 3 5
More informationClimbing discrepancy search for flowshop and jobshop scheduling with time-lags
Climbing discrepancy search for flowshop and jobshop scheduling with time-lags Wafa Karoui, Marie-José Huguet, Pierre Lopez, Mohamed Haouari To cite this version: Wafa Karoui, Marie-José Huguet, Pierre
More informationCS 374: Algorithms & Models of Computation, Spring 2017 Greedy Algorithms Lecture 19 April 4, 2017 Chandra Chekuri (UIUC) CS374 1 Spring / 1
CS 374: Algorithms & Models of Computation, Spring 2017 Greedy Algorithms Lecture 19 April 4, 2017 Chandra Chekuri (UIUC) CS374 1 Spring 2017 1 / 1 Part I Greedy Algorithms: Tools and Techniques Chandra
More informationEvolutionary Ensemble Strategies for Heuristic Scheduling
0 International Conference on Computational Science and Computational Intelligence Evolutionary Ensemble Strategies for Heuristic Scheduling Thomas Philip Runarsson School of Engineering and Natural Science
More informationThis means that we can assume each list ) is
This means that we can assume each list ) is of the form ),, ( )with < and Since the sizes of the items are integers, there are at most +1pairs in each list Furthermore, if we let = be the maximum possible
More informationCSE101: Design and Analysis of Algorithms. Ragesh Jaiswal, CSE, UCSD
Course Overview Material that will be covered in the course: Basic graph algorithms Algorithm Design Techniques Greedy Algorithms Divide and Conquer Dynamic Programming Network Flows Computational intractability
More informationChapter 11. Approximation Algorithms. Slides by Kevin Wayne Pearson-Addison Wesley. All rights reserved.
Chapter 11 Approximation Algorithms Slides by Kevin Wayne. Copyright @ 2005 Pearson-Addison Wesley. All rights reserved. 1 Approximation Algorithms Q. Suppose I need to solve an NP-hard problem. What should
More informationIntegrated Network Design and Scheduling Problems with Parallel Identical Machines: Complexity Results and Dispatching Rules
Integrated Network Design and Scheduling Problems with Parallel Identical Machines: Complexity Results and Dispatching Rules Sarah G. Nurre 1 and Thomas C. Sharkey 1 1 Department of Industrial and Systems
More informationCHAPTER 16: SCHEDULING
CHAPTER 16: SCHEDULING Solutions: 1. Job A B C A B C 1 5 8 6 row 1 0 3 1 Worker 2 6 7 9 reduction 2 0 1 3 3 4 5 3 3 1 2 0 column reduction A B C 1 0 2 1 Optimum: 2 0 0 3 Worker 1, Job A 3 1 1 0 2 B 3 C
More informationMore Approximation Algorithms
CS 473: Algorithms, Spring 2018 More Approximation Algorithms Lecture 25 April 26, 2018 Most slides are courtesy Prof. Chekuri Ruta (UIUC) CS473 1 Spring 2018 1 / 28 Formal definition of approximation
More informationThe CON Job Scheduling Problem on a Single and Parallel Machines
The CON Job Scheduling Problem on a Single and Parallel Machines Huajun Zhou A Thesis Submitted to the University of North Carolina at Wilmington in Partial Fulfillment Of the Requirements for the Degree
More informationPriority-driven Scheduling of Periodic Tasks (1) Advanced Operating Systems (M) Lecture 4
Priority-driven Scheduling of Periodic Tasks (1) Advanced Operating Systems (M) Lecture 4 Priority-driven Scheduling Assign priorities to jobs, based on their deadline or other timing constraint Make scheduling
More informationOn Two Class-Constrained Versions of the Multiple Knapsack Problem
On Two Class-Constrained Versions of the Multiple Knapsack Problem Hadas Shachnai Tami Tamir Department of Computer Science The Technion, Haifa 32000, Israel Abstract We study two variants of the classic
More informationAN INTEGRATED COLUMN GENERATION AND LAGRANGIAN RELAXATION FOR SOLVING FLOWSHOP PROBLEMS TO MINIMIZE THE TOTAL WEIGHTED TARDINESS
International Journal of Innovative Computing, Information and Control ICIC International c 2011 ISSN 1349-4198 Volume 7, Number 11, November 2011 pp. 6453 6471 AN INTEGRATED COLUMN GENERATION AND LAGRANGIAN
More informationHEURISTICS FOR TWO-MACHINE FLOWSHOP SCHEDULING WITH SETUP TIMES AND AN AVAILABILITY CONSTRAINT
HEURISTICS FOR TWO-MACHINE FLOWSHOP SCHEDULING WITH SETUP TIMES AND AN AVAILABILITY CONSTRAINT Wei Cheng Health Monitor Network, Parmus, NJ John Karlof Department of Mathematics and Statistics University
More informationRough Set Theory. Andrew Kusiak Intelligent Systems Laboratory 2139 Seamans Center The University of Iowa Iowa City, Iowa
Rough Set Theory Andrew Kusiak 139 Seamans Center Iowa City, Iowa 54-157 Iowa City Tel: 319-335 5934 Fa: 319-335 5669 andrew-kusiak@uiowa.edu http://www.icaen.uiowa.edu/~ankusiak Benefits Evaluation of
More informationTask Models and Scheduling
Task Models and Scheduling Jan Reineke Saarland University June 27 th, 2013 With thanks to Jian-Jia Chen at KIT! Jan Reineke Task Models and Scheduling June 27 th, 2013 1 / 36 Task Models and Scheduling
More informationFINAL EXAM PRACTICE PROBLEMS CMSC 451 (Spring 2016)
FINAL EXAM PRACTICE PROBLEMS CMSC 451 (Spring 2016) The final exam will be on Thursday, May 12, from 8:00 10:00 am, at our regular class location (CSI 2117). It will be closed-book and closed-notes, except
More informationStochastic Petri Net
Stochastic Petri Net Serge Haddad LSV ENS Cachan & CNRS & INRIA haddad@lsv.ens-cachan.fr Petri Nets 2013, June 24th 2013 1 Stochastic Petri Net 2 Markov Chain 3 Markovian Stochastic Petri Net 4 Generalized
More informationA Heuristic Method for Job-Shop Scheduling with an Infinite Wait Buffer
A Heuristic Method for ob-shop Scheduling with an Infinite Wait Buffer - From One-Machine to Multi-Machine Problems Z.. Zhao *. Kim M. Luo H. C. Lau S. S. Ge.B. Zhang Abstract Through empirical comparison
More informationarxiv: v2 [cs.dm] 2 Mar 2017
Shared multi-processor scheduling arxiv:607.060v [cs.dm] Mar 07 Dariusz Dereniowski Faculty of Electronics, Telecommunications and Informatics, Gdańsk University of Technology, Gdańsk, Poland Abstract
More informationProcedia Computer Science 00 (2011) 000 6
Procedia Computer Science (211) 6 Procedia Computer Science Complex Adaptive Systems, Volume 1 Cihan H. Dagli, Editor in Chief Conference Organized by Missouri University of Science and Technology 211-
More informationA note on the complexity of the concurrent open shop problem
J Sched (2006) 9: 389 396 DOI 10.1007/s10951-006-7042-y A note on the complexity of the concurrent open shop problem Thomas A. Roemer C Science + Business Media, LLC 2006 Abstract The concurrent open shop
More informationOutline. Introduction, or what is fuzzy thinking? Fuzzy sets Linguistic variables and hedges Operations of fuzzy sets Fuzzy rules Summary.
Fuzzy Logic Part ndrew Kusiak Intelligent Systems Laboratory 239 Seamans Center The University of Iowa Iowa City, Iowa 52242-527 andrew-kusiak@uiowa.edu http://www.icaen.uiowa.edu/~ankusiak Tel: 39-335
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpenCourseWare http://ocw.mit.edu 6.854J / 18.415J Advanced Algorithms Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advanced
More informationRobust optimization for resource-constrained project scheduling with uncertain activity durations
Robust optimization for resource-constrained project scheduling with uncertain activity durations Christian Artigues 1, Roel Leus 2 and Fabrice Talla Nobibon 2 1 LAAS-CNRS, Université de Toulouse, France
More informationEmbedded Systems 14. Overview of embedded systems design
Embedded Systems 14-1 - Overview of embedded systems design - 2-1 Point of departure: Scheduling general IT systems In general IT systems, not much is known about the computational processes a priori The
More informationNon-preemptive multiprocessor scheduling of strict periodic systems with precedence constraints
Non-preemptive multiprocessor scheduling of strict periodic systems with precedence constraints Liliana Cucu, Yves Sorel INRIA Rocquencourt, BP 105-78153 Le Chesnay Cedex, France liliana.cucu@inria.fr,
More informationReview Exercise 2. 1 a Chemical A 5x+ Chemical B 2x+ 2y12 [ x+ Chemical C [ 4 12]
Review Exercise a Chemical A 5x+ y 0 Chemical B x+ y [ x+ y 6] b Chemical C 6 [ ] x+ y x+ y x, y 0 c T = x+ y d ( x, y) = (, ) T = Pearson Education Ltd 08. Copying permitted for purchasing institution
More informationLecture 2: Scheduling on Parallel Machines
Lecture 2: Scheduling on Parallel Machines Loris Marchal October 17, 2012 Parallel environment alpha in Graham s notation): P parallel identical Q uniform machines: each machine has a given speed speed
More informationA note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing times
Optim Lett (2012) 6:1021 1025 DOI 10.1007/s11590-011-0330-2 SHORT COMMUNICATION A note on proving the strong NP-hardness of some scheduling problems with start time dependent job processing times Radosław
More informationExact Mixed Integer Programming for Integrated Scheduling and Process Planning in Flexible Environment
Journal of Optimization in Industrial Engineering 15 (2014) 47-53 Exact ixed Integer Programming for Integrated Scheduling and Process Planning in Flexible Environment ohammad Saidi mehrabad a, Saeed Zarghami
More informationMore on NP and Reductions
Indian Institute of Information Technology Design and Manufacturing, Kancheepuram Chennai 600 127, India An Autonomous Institute under MHRD, Govt of India http://www.iiitdm.ac.in COM 501 Advanced Data
More informationMinimizing Mean Flowtime and Makespan on Master-Slave Systems
Minimizing Mean Flowtime and Makespan on Master-Slave Systems Joseph Y-T. Leung,1 and Hairong Zhao 2 Department of Computer Science New Jersey Institute of Technology Newark, NJ 07102, USA Abstract The
More informationShannon-Fano-Elias coding
Shannon-Fano-Elias coding Suppose that we have a memoryless source X t taking values in the alphabet {1, 2,..., L}. Suppose that the probabilities for all symbols are strictly positive: p(i) > 0, i. The
More informationMetode şi Algoritmi de Planificare (MAP) Curs 2 Introducere în problematica planificării
Metode şi Algoritmi de Planificare (MAP) 2009-2010 Curs 2 Introducere în problematica planificării 20.10.2009 Metode si Algoritmi de Planificare Curs 2 1 Introduction to scheduling Scheduling problem definition
More informationCIS 4930/6930: Principles of Cyber-Physical Systems
CIS 4930/6930: Principles of Cyber-Physical Systems Chapter 11 Scheduling Hao Zheng Department of Computer Science and Engineering University of South Florida H. Zheng (CSE USF) CIS 4930/6930: Principles
More informationNP-Completeness. NP-Completeness 1
NP-Completeness Reference: Computers and Intractability: A Guide to the Theory of NP-Completeness by Garey and Johnson, W.H. Freeman and Company, 1979. NP-Completeness 1 General Problems, Input Size and
More information20. Dynamic Programming II
Quiz Solution 20. Dynamic Programming II Subset sum problem, knapsack problem, greedy algorithm vs dynamic programming [Ottman/Widmayer, Kap. 7.2, 7.3, 5.7, Cormen et al, Kap. 15,35.5] n n Table Entry
More informationEmbedded Systems Design: Optimization Challenges. Paul Pop Embedded Systems Lab (ESLAB) Linköping University, Sweden
of /4 4 Embedded Systems Design: Optimization Challenges Paul Pop Embedded Systems Lab (ESLAB) Linköping University, Sweden Outline! Embedded systems " Example area: automotive electronics " Embedded systems
More informationEmbedded Systems 15. REVIEW: Aperiodic scheduling. C i J i 0 a i s i f i d i
Embedded Systems 15-1 - REVIEW: Aperiodic scheduling C i J i 0 a i s i f i d i Given: A set of non-periodic tasks {J 1,, J n } with arrival times a i, deadlines d i, computation times C i precedence constraints
More information1 Ordinary Load Balancing
Comp 260: Advanced Algorithms Prof. Lenore Cowen Tufts University, Spring 208 Scribe: Emily Davis Lecture 8: Scheduling Ordinary Load Balancing Suppose we have a set of jobs each with their own finite
More informationOptimal on-line algorithms for single-machine scheduling
Optimal on-line algorithms for single-machine scheduling J.A. Hoogeveen A.P.A. Vestjens Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O.Box 513, 5600 MB, Eindhoven,
More informationIE652 - Chapter 10. Assumptions. Single Machine Scheduling
IE652 - Chapter 10 Single Machine Scheduling 1 Assumptions All jobs are processed on a single machine Release time of each job is 0 Processing times are known with certainty Scheduling Sequencing in this
More informationOnline Algorithms for a Generalized Parallel Machine Scheduling Problem
PARALLEL MACHINE SCHEDULING PROBLEM 1 Online Algorithms for a Generalized Parallel Machine Scheduling Problem István SZALKAI 1,2, György DÓSA 1,3 1 Department of Mathematics, University of Pannonia, Veszprém,
More informationAPTAS for Bin Packing
APTAS for Bin Packing Bin Packing has an asymptotic PTAS (APTAS) [de la Vega and Leuker, 1980] For every fixed ε > 0 algorithm outputs a solution of size (1+ε)OPT + 1 in time polynomial in n APTAS for
More informationThe coordinated scheduling of steelmaking with multi-refining and tandem transportation
roceedings of the 17th World Congress The International Federation of Automatic Control The coordinated scheduling of steelmaking with multi-refining and tandem transportation Jing Guan*, Lixin Tang*,
More informationLogic-based Benders Decomposition
Logic-based Benders Decomposition A short Introduction Martin Riedler AC Retreat Contents 1 Introduction 2 Motivation 3 Further Notes MR Logic-based Benders Decomposition June 29 July 1 2 / 15 Basic idea
More informationBatch delivery scheduling with simple linear deterioration on a single machine 1
Acta Technica 61, No. 4A/2016, 281 290 c 2017 Institute of Thermomechanics CAS, v.v.i. Batch delivery scheduling with simple linear deterioration on a single machine 1 Juan Zou 2,3 Abstract. Several single
More informationKnapsack and Scheduling Problems. The Greedy Method
The Greedy Method: Knapsack and Scheduling Problems The Greedy Method 1 Outline and Reading Task Scheduling Fractional Knapsack Problem The Greedy Method 2 Elements of Greedy Strategy An greedy algorithm
More informationComputational Complexity
Computational Complexity Algorithm performance and difficulty of problems So far we have seen problems admitting fast algorithms flow problems, shortest path, spanning tree... and other problems for which
More informationLow-Complexity Algorithms for Sequencing Jobs with a Fixed Number of Job-Classes
Low-Complexity Algorithms for Sequencing Jobs with a Fixed Number of Job-Classes Jack A.A. van der Veen Nijenrode University - The Netherlands School of Business Straatweg 25, 3621 BG Breukelen The Netherlands
More information4. How to prove a problem is NPC
The reducibility relation T is transitive, i.e, A T B and B T C imply A T C Therefore, to prove that a problem A is NPC: (1) show that A NP (2) choose some known NPC problem B define a polynomial transformation
More informationOnline Appendix for Coordination of Outsourced Operations at a Third-Party Facility Subject to Booking, Overtime, and Tardiness Costs
Submitted to Operations Research manuscript OPRE-2009-04-180 Online Appendix for Coordination of Outsourced Operations at a Third-Party Facility Subject to Booking, Overtime, and Tardiness Costs Xiaoqiang
More informationA FLOWSHOP SCHEDULING ALGORITHM TO MINIMIZE TOTAL FLOWTIME
Journal of the Operations Research Society of Japan Vo!. 34, No. 1, March 1991 1991 The Operations Research Society of Japan A FLOWSHOP SCHEDULING ALGORITHM TO MINIMIZE TOTAL FLOWTIME Chandrasekharan Rajendran
More informationFundamental Algorithms for System Modeling, Analysis, and Optimization
Fundamental Algorithms for System Modeling, Analysis, and Optimization Edward A. Lee, Jaijeet Roychowdhury, Sanjit A. Seshia UC Berkeley EECS 144/244 Fall 2010 Copyright 2010, E. A. Lee, J. Roydhowdhury,
More informationSub-Optimal Scheduling of a Flexible Batch Manufacturing System using an Integer Programming Solution
Sub-Optimal Scheduling of a Flexible Batch Manufacturing System using an Integer Programming Solution W. Weyerman, D. West, S. Warnick Information Dynamics and Intelligent Systems Group Department of Computer
More informationMINIMIZING TOTAL TARDINESS FOR SINGLE MACHINE SEQUENCING
Journal of the Operations Research Society of Japan Vol. 39, No. 3, September 1996 1996 The Operations Research Society of Japan MINIMIZING TOTAL TARDINESS FOR SINGLE MACHINE SEQUENCING Tsung-Chyan Lai
More informationHow much can lookahead help in online single machine scheduling
JID:IPL AID:3753 /SCO [m3+; v 1.80; Prn:16/11/2007; 10:54] P.1 (1-5) Information Processing Letters ( ) www.elsevier.com/locate/ipl How much can lookahead help in online single machine scheduling Feifeng
More informationEnergy-efficient Mapping of Big Data Workflows under Deadline Constraints
Energy-efficient Mapping of Big Data Workflows under Deadline Constraints Presenter: Tong Shu Authors: Tong Shu and Prof. Chase Q. Wu Big Data Center Department of Computer Science New Jersey Institute
More informationCS 4700: Foundations of Artificial Intelligence Ungraded Homework Solutions
CS 4700: Foundations of Artificial Intelligence Ungraded Homework Solutions 1. Neural Networks: a. There are 2 2n distinct Boolean functions over n inputs. Thus there are 16 distinct Boolean functions
More informationSingle-Facility Scheduling by Logic-Based Benders Decomposition
Single-Facility Scheduling by Logic-Based Benders Decomposition Elvin Coban J. N. Hooker Tepper School of Business Carnegie Mellon University ecoban@andrew.cmu.edu john@hooker.tepper.cmu.edu September
More informationThe two-machine flowshop total completion time problem: A branch-and-bound based on network-flow formulation
The two-machine flowshop total completion time problem: A branch-and-bound based on network-flow formulation Boris Detienne 1, Ruslan Sadykov 1, Shunji Tanaka 2 1 : Team Inria RealOpt, University of Bordeaux,
More informationCS 580: Algorithm Design and Analysis. Jeremiah Blocki Purdue University Spring 2018
CS 580: Algorithm Design and Analysis Jeremiah Blocki Purdue University Spring 2018 Chapter 9 PSPACE: A Class of Problems Beyond NP Slides by Kevin Wayne. Copyright @ 2005 Pearson-Addison Wesley. All rights
More informationOptimisation. 3/10/2010 Tibor Illés Optimisation
Optimisation Lectures 3 & 4: Linear Programming Problem Formulation Different forms of problems, elements of the simplex algorithm and sensitivity analysis Lecturer: Tibor Illés tibor.illes@strath.ac.uk
More informationOn-line Scheduling of Two Parallel Machines. with a Single Server
On-line Scheduling of Two Parallel Machines with a Single Server Lele Zhang, Andrew Wirth Department of Mechanical and Manufacturing Engineering, The University of Melbourne, VIC 3010, Australia Abstract
More informationJOB SEQUENCING WITH DEADLINES
JOB SEQUENCING WITH DEADLINES The problem is stated as below. There are n jobs to be processed on a machine. Each job i has a deadline d i 0 and profit p i 0. Pi is earned iff the job is completed by its
More informationOn Machine Dependency in Shop Scheduling
On Machine Dependency in Shop Scheduling Evgeny Shchepin Nodari Vakhania Abstract One of the main restrictions in scheduling problems are the machine (resource) restrictions: each machine can perform at
More informationScheduling Online Algorithms. Tim Nieberg
Scheduling Online Algorithms Tim Nieberg General Introduction on-line scheduling can be seen as scheduling with incomplete information at certain points, decisions have to be made without knowing the complete
More information