• Publications
  • Influence
The state of the art on buffer allocation problem: a comprehensive survey
The buffer allocation problem is an NP-hard combinatorial optimization problem and it is an important research issue in designing manufacturing systems. The problem deals with finding optimal bufferExpand
  • 99
  • 5
Trip Allocation and Stacking Policies at a Container Terminal
Abstract There are three crucial resources at container terminals; the yard, cranes and the vehicles. The main objective of the terminal is the efficient use of these resources while performingExpand
  • 20
  • 4
  • PDF
Two approaches for solving the buffer allocation problem in unreliable production lines
Abstract This paper presents an integrated approach to solve the buffer allocation problem in unreliable production lines so as to maximize the throughput rate of the line with minimum total bufferExpand
  • 20
  • 3
Heuristics for operational fixed job scheduling problems with working and spread time constraints
Operational fixed job scheduling problems select a set of jobs having fixed ready and processing times and schedule the selected jobs on parallel machines so as to maximize the total weight. In thisExpand
  • 11
  • 3
  • PDF
Spread time considerations in operational fixed job scheduling
In this study, we consider the operational fixed job scheduling problem on identical parallel machines. We assume that the jobs have fixed ready times and deadlines, and spread time constraints areExpand
  • 14
  • 2
An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines
The buffer allocation problem, i.e. how much buffer storage to allow and where to place it within the line, is an important research issue in designing production lines. In this study, a novelExpand
  • 40
  • 1
A vehicle scheduling problem with fixed trips and time limitations
We consider minimum-cost scheduling of different vehicle types on a predetermined set of one-way trips. Trips have predetermined ready times, deadlines and associated demands. All trips must beExpand
  • 24
  • 1
  • PDF
A fixed job scheduling problem with machine-dependent job weights
This study considers the identical parallel machines operational fixed job scheduling problem with machine-dependent job weights. A job is either processed in a fixed interval or is not processed atExpand
  • 12
  • 1
A Comparison of Three Search Algorithms for Solving the Buffer Allocation Problem in Reliable Production Lines
This paper investigates the performance of three search algorithms: Myopic Algorithm, Adaptive Tabu Search and Degraded Ceiling to solve the buffer allocation problem in reliable production lines.Expand
  • 1
  • 1