Search
Now showing items 1-6 of 6
Heuristic and Exact Algorithms for the Two-Machine Just in Time Job Shop Scheduling Problem
(
Hindawi Limited
, 2016 , Article)
The problem addressed in this paper is the two-machine job shop scheduling problem when the objective is to minimize the total earliness and tardiness from a common due date (CDD) for a set of jobs when their weights equal ...
An Integrated Quay Crane Assignment and Scheduling Problem Using Branch-and-Price
(
Institute of Electrical and Electronics Engineers Inc.
, 2017 , Conference Paper)
This paper investigates the integrated quay crane assignment and scheduling problem (QCASP). The problem requires determining the assignment of quay cranes to vessels and the scheduling of operations to be performed by ...
Meta-heuristics for aircraft arrival and departure scheduling on multiple runways
(
Institute of Industrial Engineers
, 2012 , Conference Paper)
The problem of scheduling aircrafts on multiple runways can be modeled as an identical parallel machine scheduling with release times, target times and deadlines. To schedule arriving and departing aircrafts as close as ...
Heuristic algorithms for aircraft sequencing problem
(2012 , Conference Paper)
Delays in flights resulting in multi-billion-dollar losses are declared annually worldwide. Hence, an identification of air traffic policies that can reduce frequent and costly inefficiencies is needed. The problem of ...
Greedy algorithms and metaheuristics for a multiple runway combined arrival-departure aircraft sequencing problem
(
Elsevier
, 2013 , Article)
This paper examines the Aircraft Sequencing Problem (ASP) over multiple runways, under mixed mode operations with the objective of minimizing the total weighted tardiness of aircraft landings and departures simultaneously. ...
New characteristics of optimal solutions for the two-machine flowshop problem with unlimited buffers
(
Taylor and Francis Ltd.
, 2019 , Article)
The two-machine flowshop problem with unlimited buffers with the objective of minimising the makespan (F2||Cmax) is addressed. Johnson’s algorithm finds optimal solutions (permutations) to this problem, but are not necessarily ...