Difference between revisions of "Job shop scheduling"

From Cornell University Computational Optimization Open Textbook - Optimization Wiki
Jump to navigation Jump to search
Line 11: Line 11:
  
 
==Applications==
 
==Applications==
 +
There are several ways in which the job-shop scheduling problem can be modified, often to simplify the problem, for a variety of applications.
 +
 +
For example, in the manufacturing industry, it is common for some jobs to require certain machines to perform tasks, due to the proper capabilities or equipment of a given machine. This adds an additional layer of complexity to the problem, because not any job can be processed on any machine. This is known as flexible manufacturing.
 +
 +
This problem can also be applied to many projects in the technology industry. In computer programming, it is typical that instructions can only be executed one at a time, sequentially. In this example of multiprocessor task scheduling, the instructions are the jobs to be performed and the processors required for each task can be compared to the machines.
 +
 +
In automation, tasks are similarly optimized.
 +
 +
 +
https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.571.9912&rep=rep1&type=pdf
  
 
==Conclusions==
 
==Conclusions==
  
 
==References==
 
==References==

Revision as of 17:55, 5 November 2021

Authors: Carly Cozzolino, Brianna Christiansen, Elaine Vallejos, Michael Sorce, Jeff Visk (SYSEN 5800 Fall 2021)

Introduction

Theory/Methodology/Algorithms

At least one numerical example

encouraged to have more than one

Applications

There are several ways in which the job-shop scheduling problem can be modified, often to simplify the problem, for a variety of applications.

For example, in the manufacturing industry, it is common for some jobs to require certain machines to perform tasks, due to the proper capabilities or equipment of a given machine. This adds an additional layer of complexity to the problem, because not any job can be processed on any machine. This is known as flexible manufacturing.

This problem can also be applied to many projects in the technology industry. In computer programming, it is typical that instructions can only be executed one at a time, sequentially. In this example of multiprocessor task scheduling, the instructions are the jobs to be performed and the processors required for each task can be compared to the machines.

In automation, tasks are similarly optimized.


https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.571.9912&rep=rep1&type=pdf

Conclusions

References