Person:
ÇALIŞ USLU, BANU

Profile Picture

Email Address

Birth Date

Research Projects

Organizational Units

OrgUnit Logo
Organizational Unit

Job Title

Last Name

ÇALIŞ USLU

First Name

BANU

Name

Filters

20152
Reset filters

Settings

Author: BULKAN, SEROL ×

Search Results

Now showing 1 - 2 of 2
  • Thumbnail Image
    PublicationOpen Access
    A HEURISTIC APPROACH TO MINIMISING MAXIMUM LATENESS ON A SINGLE MACHINE
    (SOUTHERN AFRICAN INST INDUSTRIAL ENGINEERING, 2015-11-30) ÇALIŞ USLU, BANU; Calis, B.; Bulkan, S.; Tuncer, F.
    This paper focuses on the problem of scheduling on a single machine to minimise the maximum lateness when each job has a different ready time, processing time, and due date. A simple procedure is developed to find a better solution than the early due date (EDD) algorithm. The new algorithm suggested in this paper is called Least Slack Time Look Ahead (LST-LA), which minimises the maximum lateness problem. Computational results show that when the number of jobs increases, LST-LA outperforms EDD.
  • No Thumbnail Available
    PublicationMetadata only
    A research survey: review of AI solution strategies of job shop scheduling problem
    (SPRINGER, 2015) ÇALIŞ USLU, BANU; Calis, Banu; Bulkan, Serol
    This paper focus on artificial intelligence approaches to NP-hard job shop scheduling (JSS) problem. In the literature successful approaches of artificial intelligence techniques such as neural network, genetic algorithm, multi agent systems, simulating annealing, bee colony optimization, ant colony optimization, particle swarm algorithm, etc. are presented as solution approaches to job shop scheduling problem. These studies are surveyed and their successes are listed in this article.