The assignment problem is a problem that takes many forms in optimization and graph
theory, and by changing some of the constraints or interpreting them differently and adding …

In this paper, we address the permutation flow shop scheduling problem with sequence-
dependent and non-anticipatory setup times. These setups are performed or supervised by …

This paper investigates the performance of two families of mixed-integer linear programing
(MILP) models for solving the regular permutation flowshop problem to minimize makespan …

1.1 Background The problem setting for this thesis was initiated by a joint project—“New
combinatorial algorithms in logistics optimisation”—of TU München with Munich-based …

The generalized assignment problem is a classical combinatorial optimization problem
known to be NP-hard. It can model a variety of real world applications in location, allocation …

We examine the basis structure of the linear relaxation of the generalized assignment
problem. The basis gives a surprising amount of information. This leads to a very simple …

The paper is an extension of the classical permutation flow-shop scheduling problem to the
case where some of the job operation processing times are convex decreasing functions of …

The generalized assignment problem is a classical combinatorial optimization problem
known to be NP-hard. It can model a variety of real world applications in location, allocation …

In this article we address the non‐preemptive flow shop scheduling problem for minimization
of the sum of the completion times. We present a new modeling framework and give a novel …

The permutation flowshop scheduling problem (PFSP) has been extensively studied in the
scheduling literature. In this paper, we present an improved memetic algorithm (MA) to solve …