Difference between revisions of "Job shop scheduling"
|Line 3:||Line 3:|
The Job-Shop Scheduling Problem (JSSP) is
The Job-Shop Scheduling Problem (JSSP) is optimization problem, which mainly concerns the operations industry. The aim of the problem is to optimize the schedule for allocation of shared resources over time to competing activities<ref name=":0">T. Yamada and R. Nakano. "Job Shop Scheduling," IEEE Control Engineering Series, 1997.</ref>.
a JSSP as machines (''M'' )('''') that will need to be completed machines require a specific machine.assumed only process one at a time.
|Line 31:||Line 33:|
Revision as of 17:05, 28 November 2021
Authors: Carly Cozzolino, Brianna Christiansen, Elaine Vallejos, Michael Sorce, Jeff Visk (SYSEN 5800 Fall 2021)
The Job-Shop Scheduling Problem (JSSP) is a combinatorial optimization problem, which mainly concerns the operations industry. The aim of the problem is to optimize the schedule for allocation of shared resources over time to competing activities.
Within a JSSP you will have n number of jobs (J1, J2, ..., Jn ), that will need to be completed using a m number shared resources, most commonly denoted as machines (M1, M2, ..., Mm ). Each job will have operations (O) that will need to be completed in a specific order in order for the job to be completed. Operations must be completed at specific machines and require a specific amount of processing time (p) on that machine.Machines are assumed to only be able to process one operation at a time, driving the need to optimize the order in which these operations are completed. The goal of the JSSP is to minimize the overall time it takes to complete all n jobs within the problem.
The job shop scheduling problem is NP-hard meaning it’s complexity class for non-deterministic polynomial-time is least as hard as the hardest of problems in NP. As an input, there is a finite set J of jobs and a finite set of M of machines. Some jobs may need to be processed through multiple machines giving us an optimal potential processing order for each job. The processing time of the job j on machine m can be defined as the nonnegative integer . In order to minimize total completion time, the job shop can find the optimal schedule of J on M.
The assumptions made for solving the problem are as follows. The number of operations for each job is finite. The processing time for each operation in a particular machine is defined. There is a pre-defined sequence of operations that has to be maintained to complete each job. Delivery times of the products are undefined. No setup cost and tardiness cost. A machine can process only one job at a time. Each job visits each machine only once. No machine can deal with more than one type of task. The system cannot be interrupted until each operation of each job is finished. No machine can halt a job and start another job, before finishing the previous one. Given these assumptions, the problem can be solved at complexity class NP-hard.
One way of visualizing the job shop scheduling problem is using a Gantt-Chart. Given a problem of size 3 x 3 (J x M), a solution can be represented as shown in Figure 1. Depending on the job, the operating time on each machine could vary.
At least one numerical example
encouraged to have more than one
There are several ways in which the job-shop scheduling problem can be modified, often to simplify the problem at hand, for a variety of applications.
The most obvious example can be found in the manufacturing industry, as the name suggests. It is common for some production 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. Furthermore, there are many uncertain factors that are not accounted for in the basic understanding of the problem, such as delays in delivery of necessary supplies, significant absence of workers, equipment malfunction, etc. 
....improve the adaptability?
This problem can also be applied to many projects in the technology industry. In computer programming, it is typical that computer instructions can only be executed one at a time on a single processor, sequentially. In this example of multiprocessor task scheduling, the instructions can be thought of as the "jobs" to be performed and the processors required for each task can be compared to the "machines". Here we would want to schedule the order of instructions such that the number of operations performed is maximized to make the computer as efficient as possible. Within this application, there are a further variety of heuristic methods considered as to how to execute tasks to maximize efficiency and minimize costs, including minimum completion time, duplex, max-min, min-min, tabu search, and genetic algorithm. Each of these methods have their advantages and disadvantages, weighing the importance of minimizing execution time versus finding the closest to optimal solution.
With the progression of automation in recent years, robotic tasks such as moving objects from one location to another are similarly optimized. In this application, the extent of movement of the robot is minimized while conducting the most amount of transport jobs to support the most effective productivity of the robot.
- T. Yamada and R. Nakano. "Job Shop Scheduling," IEEE Control Engineering Series, 1997.
- P. Brucker, B. Jurisch and B. Sievers. "A branch and bound algorithm for the job-shop scheduling problem", Discrete Applied Mathematics, 1994.
- D. Applegate and W. Cook. "A computational study of the job-shop scheduling problem," ORSA J. on Comput, 1991.
- K. Hasan. "Evolutionary Algorithms for Solving Job-Shop Scheduling Problems in the Presence of Process Interruptions," Rajshahi University of Engineering and Technology, Bangladesh. 2009.
- Abdeyazdan M., Rahmani A.M. (2008) Multiprocessor Task Scheduling using a new Prioritizing Genetic Algorithm based on number of Task Children. In: Kacsuk P., Lovas R., Németh Z. (eds) Distributed and Parallel Systems. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-79448-8_10