Abstract: This paper presents the review of past studies
concerning mathematical models for rescheduling passenger railway
services, as part of delay management in the occurrence of railway
disruption. Many past mathematical models highlighted were aimed
at minimizing the service delays experienced by passengers during
service disruptions. Integer programming (IP) and mixed-integer
programming (MIP) models are critically discussed, focusing on the
model approach, decision variables, sets and parameters. Some of
them have been tested on real-life data of railway companies
worldwide, while a few have been validated on fictive data. Based
on selected literatures on train rescheduling, this paper is able to
assist researchers in the model formulation by providing
comprehensive analyses towards the model building. These analyses
would be able to help in the development of new approaches in
rescheduling strategies or perhaps to enhance the existing
rescheduling models and make them more powerful or more
applicable with shorter computing time.
Abstract: Perishable goods constitute a large portion of retailer inventory and lose value with time due to deterioration and/or obsolescence. Retailers dealing with such goods required considering the factors of short shelf life and the dependency of sales on inventory displayed in determining optimal procurement policy. Many retailers follow the practice of using two bins - primary bin sales fresh items at a list price and secondary bin sales unsold items at a discount price transferred from primary bin on attaining certain age. In this paper, mathematical models are developed for primary bin and for secondary bin that maximizes profit with decision variables of order quantities, optimal review period and optimal selling price at secondary bin. The demand rates in two bins are assumed to be deterministic and dependent on displayed inventory level, price and age but independent of each other. The validity of the model is shown by solving an example and the sensitivity analysis of the model is also reported.
Abstract: The increasing competitiveness in manufacturing
industry is forcing manufacturers to seek effective processing
schedules. The paper presents an optimization manufacture
scheduling approach for dependent details processing with given
processing sequences and times on multiple machines. By defining
decision variables as start and end moments of details processing it is
possible to use straightforward variables restrictions to satisfy
different technological requirements and to formulate easy to
understand and solve optimization tasks for multiple numbers of
details and machines. A case study example is solved for seven base
moldings for CNC metalworking machines processed on five
different machines with given processing order among details and
machines and known processing time-s duration. As a result of linear
optimization task solution the optimal manufacturing schedule
minimizing the overall processing time is obtained. The
manufacturing schedule defines the moments of moldings delivery
thus minimizing storage costs and provides mounting due-time
satisfaction. The proposed optimization approach is based on real
manufacturing plant problem. Different processing schedules variants
for different technological restrictions were defined and implemented
in the practice of Bulgarian company RAIS Ltd. The proposed
approach could be generalized for other job shop scheduling
problems for different applications.