We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
JOB SHOP SCHEDULING METHODS REVIEW.
- Authors
B., BUCHMEISTER; I., PALCIC; R., OJSTERSEK
- Abstract
A production system can be viewed as a network through which jobs flow, wait in buffers, and are processed by workstations. One of the main problems in job shops is how to handle the variety of products. The resources used in production are limited, so scheduling becomes a very important concept for management decision making. This importance draws the attention of both practitioners and academicians to scheduling. Scheduling is a complex and difficult problem. Scheduling the production of multiple products is a classic problem in production planning research. Long lead times, unacceptable work-in-process (WIP) inventories, failure to meet due dates, and other barriers to profitability are found in every manufacturing facility. There are job sequencing methods, resource allocation rules, and mathematical and heuristic algorithms. Conventional optimization methods are insufficient for large problems in terms of solution time. In this paper, an overview of scheduling methods for a job shop and a discussion about their applicability are given.
- Subjects
PRODUCTION scheduling; RESOURCE allocation; HEURISTIC algorithms; PRODUCTION planning; JOB shops; MANUFACTURING workstations
- Publication
Annals of DAAAM & Proceedings, 2021, Vol 32, p1
- ISSN
1726-9679
- Publication type
Article
- DOI
10.2507/daaam.scibook.2021.01