• HOME
• ABOUT US
  • Name Address
  • General Description
  • Governance
  • Academic Calendar
  • Degree Programmes
  • List of Programmes in English
  • General Admission and Registration Procedures
  • Credit Mobility and Recognition of Prior Learning
  • ECTS Credit Allocation
  • Academic Guidance
  • Contacts
• Degree Programmes
  • Third Cycle Programmes (Doctorate Degree)
  • Second Cycle Programmes (Master's Degree)
  • First Cycle Programmes (Bachelor's Degree)
  • Short Cycle Programmes (Associate's Degree)
• GENERAL INFORMATION FOR STUDENTS
  • Cost of Living
  • Accommodation
  • Meals
  • Medical Facilities
  • Facilities for Disabled Students
  • Insurance
  • Financial Supports
  • Student Affairs Office
  • Practical Information for International Students
  • Language Courses
  • Work Placement Possibilities
  • Sports, Social and Cultural Facilities
  • Student Associations and Clubs
  • About İzmir - Turkey
• INTERNATIONAL RELATIONS
  • International Relations Office
  • Registration Procedures
  • Agreements
  • Coordinators
  • Documents
  • List of Programmes in English
  • ECTS / DS Labels

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS IND 4916 PRODUCTION SCHEDULING ELECTIVE 3 0 0 4

Offered By

Industrial Engineering

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

ASSOCIATE PROFESSOR DERYA EREN AKYOL

Offered to

Industrial Engineering

Course Objective

The objective of this course is to introduce students various scheduling scheduling problems that arise in manufacturing and service organizations. In this course, optimization and heuristic methods used for solving single machine scheduling, paralel machine scheduling, flow shop and job shop scheduling problems will be taught.

Learning Outcomes of the Course Unit

1   To describe scheduling problems that arise in manufacturing and service 2   To define scheduling and sequencing concepts 3   To identify real life scheduling problems 4   To distinguish appropriate solution approaches for different performance measures 5   To be able to solve single and multi machine scheduling problems defined for different performance measures, using a scheduling software

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description 1 Introduction to Scheduling, classification of scheduling problems 2 Single machine problems: simple dispatching rules 3 Single machine problems: real time scheduling, NP-hard scheduling problems, branch and bound, dynamic programming, approximations 4 Parallel machine scheduling 5 Parallel machine scheduling 6 Flow shop scheduling 7 Flow shop scheduling 8 Midterm 9 Job shop scheduling 10 Job shop scheduling, Open shop scheduling 11 Lekin software applications 12 Stochastic scheduling 13 Developing mathematical models to solve scheduling problems 14 Student presentations

Recomended or Required Reading

Scheduling: Theory, Algorithms, and Systems by Michael L. Pinedo, 2008 Elements of sequencing and scheduling/ by Kenneth R. Baker, 1998.

Planned Learning Activities and Teaching Methods

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA 1 MTE MIDTERM EXAM 2 ASG ASSIGNMENT 3 FIN FINAL EXAM 4 FCG FINAL COURSE GRADE MTE * 0.25 + ASG * 0.25 + FIN * 0.50 5 RST RESIT 6 FCGR FINAL COURSE GRADE (RESIT) MTE * 0.25 + ASG * 0.25 + RST * 0.50

Further Notes About Assessment Methods

None

Assessment Criteria

To be announced.

Language of Instruction

English

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

derya.eren@deu.edu.tr, Tel. +90-232-3017604

Office Hours

To be announced.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours) Lectures 13 3 39 Preparations before/after weekly lectures 13 2 26 Preparation for midterm exam 1 6 6 Preparation for final exam 1 6 6 Preparing group assignments 4 3 12 Final 1 2 2 Midterm 1 2 2 Presentations 2 4 8 TOTAL WORKLOAD (hours) 101

Contribution of Learning Outcomes to Programme Outcomes

PO/LO PO.1 PO.2 PO.3 PO.4 PO.5 PO.6 PO.7 PO.8 PO.9 PO.10 PO.11 PO.12 LO.1 5 5 4 LO.2 5 LO.3 5 5 LO.4 5 5 5 4 LO.5 4 5 5 5 4