Search results

Filters

  • Journals
  • Authors
  • Keywords
  • Date
  • Type

Search results

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

Abstract

Unrelated Parallel Machines Scheduling Problem (U-PMSP) is a category of discrete optimization problems in which various manufacturing jobs are assigned to identical parallel machines at particular times. In this paper, a specific production scheduling task the U-PMSP with Machine and Job Dependent Setup Times, Availability Constraint, Time Windows and Maintenance Times is introduced. Machines with different capacity limits and maintenance times are available to perform the tasks. After that our problem, the U-PMSP with Machine and Job Dependent Setup Times, Availability Constraints, Time Windows and Maintenance Times is detailed. After that, the applied optimization algorithm and their operators are introduced. The proposed algorithm is the genetic algorithm (GA), and proposed operators are the order crossover, partially matched crossover, cycle crossover and the 2-opt as a mutation operator. Then we prove the efficiency of our algorithm with test results. We also prove the efficiency of the algorithm on our own data set and benchmark data set. The authors conclude that this GA is effective for solving high complexity parallel machine problems.
Go to article

Authors and Affiliations

Anita Agárdi
Károly Nehéz
Download PDF Download RIS Download Bibtex

Abstract

The article presents the issue of container handling processes at a rail-road intermodal terminal. In the article, we have focused on the problem of a terminal layout design from the point of view of parking lots for external trucks. The main purpose of this article is the assessment of the necessary parking lots for the trucks considering daily turnover of containers and the trucks appointment time windows. We analyze how the length of the truck’s appointment time windows as well as the difficulties in containers loading operations and a number of handling equipment influence the necessary parking lots for trucks in the intermodal terminal. The trucks planned for loading of import containers may arrive at the terminal before the loading moment that is specified in crane operations schedule. The container handling time is given by a probability distribution. The equations defining the most important elements of the considered problem were presented in the general form. The special case of this model has been developed in the FlexSim simulation software. Based on the simulation research and calculations we pointed out that right truck’s appointment time windows can significantly reduce necessary parking lots at the yard. The literature analysis presented in the article indicates that most of the research in the field of intermodal terminal is focused on operations in container ports. There is lack of literature considering rail-road terminal layout planning in terms of the necessary parking lots and truck’s appointment time windows.
Go to article

Authors and Affiliations

Emilian Szczepański
1
ORCID: ORCID
Marianna Jacyna
2
ORCID: ORCID
Roland Jachimowski
1
ORCID: ORCID
Rostislav Vašek
3
Karol Nehring
4
ORCID: ORCID

  1. Assc. Prof. PhD, Eng., Warsaw University of Technology, Faculty of Transport, ul. Koszykowa 75, 00-662 Warsaw, Poland
  2. Prof. PhD, Eng., Warsaw University of Technology, Faculty of Transport, ul. Koszykowa 75, 00-662 Warsaw, Poland
  3. ID International, Czech Republic, Nádražní 184,702 00 Ostrava
  4. MSc, Eng., Warsaw University of Technology, Faculty of Transport, ul. Koszykowa 75, 00-662 Warsaw, Poland

This page uses 'cookies'. Learn more