PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Tytuł artykułu

Case study: production orders scheduling in multiversion and multiassortment production systems - part I

Autorzy
Treść / Zawartość
Identyfikatory
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
This paper presents the issue of task scheduling, which aims in establishing a sequence of tasks, which maximizes the utilization of company’s production capacity. The problem belongs to the NP-hard class, optimal method of solution has not yet been found, only approximate solutions have been offered. Regardless of specific production system, while considering reception of new tasks into the system, current review of the state of the system is required in order to decide whether and when a new order can be accepted for execution. In this paper, the problem of task scheduling is limited to determining the field of possible solutions to the problem of appropriate prioritization of production (production orders) which in turn will be accepted for execution on the assembly line in the car industry company. Simplified structure of the production system, orders transition paths and scheduling concepts within the system limitations have been presented.
Twórcy
autor
  • The Institute of Engineering, Processes Automation and Integrated Manufacturing Systems, Faculty of Mechanical Engineering, Silesian University of Technology, Gliwice, marcin.zemczak@polsl.pl
Bibliografia
  • 1. Krenczyk D., Kalinowski K., Skołud B.: Transition scheduling for multiassortment repetitive production (in polish). Zeszyty Naukowe. Automatyka, Z. 144, Gliwice 2006
  • 2. Błażewicz J., Drabowski M., Węglarz J., Scheduling multiprocessor tasks to minimize schedule length, IEEE Transactions on Computers, 1996
  • 3. Boctor F.F.: A new and efficient heuristic for scheduling projects with resources restrictions and multiple execution models, Université Laval, Québec, Canada, 1999
  • 4. Ishii H., Martel Ch.,: A generalized uniform processor system, Operations Research, Vol. 33 No.2, 1985
  • 5. Janiak A.: Single machine scheduling problem with a common deadline and resource dependent release dates, European Journal of Operational Research, Vol. 53, Issue 3, August 1991
  • 6. Buchalski Z.: Optimization of programs scheduling and primary memory allocation in multiprocessing computer systems, Information Systems Architecture and Technology ISAT '98, Proceedings of the 20th international scientific school, Szklarska Poręba, 15-17 października 1998, Wrocław, 1998
  • 7. Srikanth K., Saxena B.: Improved genetic algorithm for the permutation flowshop scheduling problem, Computers & Operations Research, Vol. 31, Issue 4, April 2004
  • 8. Bachman A., Janiak A.: Minimizing the makespan for the single machine scheduling problem with start time and resource dependent job processing times (in polish). Zeszyty Naukowe. Automatyka, z. 129, Gliwice, 2000
  • 9. Skołud B., Krenczyk D., Kalinowski K., Kampa A., Gołda G., Dobrzańska-Danikiewicz A. : The systems aiding decisions in production planning and control. COMMENT'2005, Gliwice-Wisła [Ref.4.648 s.1-4]
  • 10. Buchalski Z.: Task scheduling in multimachines systems with execution time depends on the number of resources,(in polish) Zeszyty Naukowe. Automatyka, Z. 129, Gliwice 2000
  • 11. Janiak A., Kovalyov M.: Single machine scheduling subject to deadlines and resources dependent processing times, European Journal of Operational Research, Vol. 94, 1996
  • 12. Kalinowski K.: The concept of scheduling subsystem in an integrated management production system orders for SMEs, (in polish). Przegląd Mechaniczny. PM-90/06.
  • 13. Józefowska J.: Solving discrete-continuous project scheduling problem via a continuous resource discretization (in polish), Zeszyty Naukowe. Automatyka, Z. 129, Gliwice 2000
  • 14. Nowicki E., Smutnicki Cz.: The flow shop with parallel machines. A tabu search approach. European Journal of Operational Research, Vol. 106, Issues 2-3, April 1998
  • 15. Skołud B., Krenczyk D., Kalinowski K., Grabowik C.: Wymiana danych w systemach sterowania przepływem produkcji SWZ I KBRS. Automatyzacja procesów dyskretnych. Teoria i zastosowania. Tom II, Gliwice 2010, str. 207-214
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-BSL9-0057-0007
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.