Location of Repository

Off-Line and Dynamic Production Scheduling – A Comparative Case Study

By Bożek Andrzej and Wysocki Marian

Abstract

A comprehensive case study of manufacturing scheduling solutions development is given. It includes highly generalized scheduling problem as well as a few scheduling modes, methods and problem models. The considered problem combines flexible job shop structure, lot streaming with variable sublots, transport times, setup times, and machine calendars. Tabu search metaheuristic and constraint programming methods have been used for the off-line scheduling. Two dynamic scheduling methods have also been implemented, i.e., dispatching rules for the completely reactive scheduling and a multi-agent system for the predictivereactive scheduling. In these implementations three distinct models of the problem have been used, based on: graph representation, optimal constraint satisfaction, and Petri net formalism. Each of these solutions has been verified in computational experiments. The results are compared and some findings about advantages, disadvantages, and suggestions on using the solutions are formulated

Topics: flexible job shop, lot streaming, off-line scheduling, dynamic scheduling, tabu search, constraint programming, dispatching rules, Petri nets, multi-agent systems, Production management. Operations management, TS155-194
Publisher: De Gruyter Open
Year: 2016
DOI identifier: 10.1515/mper-2016-0003
OAI identifier: oai:doaj.org/article:c4f606637996481f8c549deff548ca1a
Journal:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://doaj.org/toc/2082-1344 (external link)
  • http://www.degruyter.com/view/... (external link)
  • https://doaj.org/article/c4f60... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.