Search results

Filters

  • Journals
  • Authors
  • Keywords
  • Date
  • Type

Search results

Number of results: 3
items per page: 25 50 75
Sort by:
Download PDF Download RIS Download Bibtex

Abstract

The paper refers to planning deliveries of food products (especially those available in certain seasons) to the recipients: supermarket networks. The paper presents two approaches to solving problems of simultaneous selection of suppliers and transportation modes and construction of product flow schedules with these transportation modes. Linear mathematical models have been built for the presented solution approaches. The cost criterion has been taken into consideration in them. The following costs have been taken into account: purchase of products by individual recipients, transport services, storing of products supplied before the planned deadlines and penalties for delays in supply of products. Two solution approaches (used for transportation planning and selection of suppliers and selection of transportation modes) have been compared. The monolithic approach calls for simultaneous solutions for the problems of supplier selection and selection of transportation modes. In the alternative (hierarchical) solution approach, suppliers are selected first, and then transportation companies and their relevant transportation modes are selected. The results of computational experiments are used for comparison of the hierarchical and monolithic solution approaches.

Go to article

Authors and Affiliations

Marek Magiera
Download PDF Download RIS Download Bibtex

Abstract

The presented method is constructed for optimum scheduling in production lines with parallel

machines and without intermediate buffers. The production system simultaneously

performs operations on various types of products. Multi-option products were taken into

account – products of a given type may differ in terms of details. This allows providing for

individual requirements of the customers. The one-level approach to scheduling for multioption

products is presented. The integer programming is used in the method – optimum

solutions are determined: the shortest schedules for multi-option products. Due to the lack

of the intermediate buffers, two possibilities are taken into account: no-wait scheduling,

possibility of the machines being blocked by products awaiting further operations. These two

types of organizing the flow through the production line were compared using computational

experiments, the results of which are presented in the paper.

Go to article

Authors and Affiliations

Marek Magiera
Download PDF Download RIS Download Bibtex

Abstract

A method of creating production schedules regarding production lines with parallel machines is presented. The production line setup provides for intermediate buffers located between individual stages. The method mostly concerns situations when part of the production machines is unavailable for performance of operations and it becomes necessary to modify the original schedule, the consequence of which is the need to build a new schedule. The cost criterion was taken into account, as the schedule is created with the lowest possible costs regarding untimely completion of products (e.g. fines for delayed product completion). The proposed method is relaxing heuristics, thanks to which scheduling is performed in a relatively short time. This was confirmed by the presented results of computational experiments. These experiments were carried out for the rescheduling of machine parts production.

Go to article

Authors and Affiliations

Marek Magiera

This page uses 'cookies'. Learn more