A two-dimensional t r i m l o s s problem is con­ sidered in which the c u t t i n g is two-stage but there are c o n s t r a i n t s on the sequencing of the c u t t i n g of o rde rs , A method is developed in which problem reduc t i on is used to generate a set of poss ib le c u t t i n g pa t te rns at each step and an h e u r i s t i c choice made of a p a t t e r n from tha t s e t . The ...

In this report, a number of Dynamic Programming algorithms for three versions of the Aircraft Sequencing problem are developed. In these, two alternative objectives are considered: How to land all of a prescribed set of airplanes as soon as possible, or alternatively, how t6minimize the total passenger waiting time. All these three versions are "static", namely, no intermediate aircraft arrival...

In this note we give an easier proof of the known result that the car sequencing problem is NP-hard, and point out that it is NP-hard in the strong sense. We show that a previous claim of NP-completeness is incorrect, and instead we give a sufficient condition of membership of NP. We also provide a pseudo-polynomial algorithm for a special case.

We consider optimal mechanism design for a sequencing problem with n jobs which require a compensation payment for waiting. The jobs’ processing requirements as well as unit costs for waiting are private data. Given public priors for this private data, we seek to find an optimal mechanism, that is, a scheduling rule and incentive compatible payments that minimize the total expected payments to ...

layer The Information Models in the abstract layer hold the fundamental modeling concepts, which are independent of a particular problem or domain and can therefore be universally applied. They describe the design guidelines (design pattern) for the construction of the other sub models in the DIM. Models like n-ary relationship, part-whole relationship, graph model and system model belong to th...

In a scenario characterized by a continuous growth of air transportation demand, the runways of large airports serve hundreds of aircraft every day. Aircraft sequencing is a challenging problem that aims to increase runway capacity in order to reduce delays as well as the workload of air traffic controllers. In many cases, the air traffic controllers solve the problem by using the simple “First...

Mixed model assembly lines (MMAL) are a type of production line where a variety of product models similar in product characteristics are assembled. The effective design of these lines requires that schedule for assembling the different products is determined. In this paper we tried to fit the sequencing problem with the main characteristics of make to order (MTO) environment. The problem solved...

This paper presents novel approaches for generating sequencing rules for the car sequencing (CS) problem in cases of two and multiple processing times per station. The CS problem decides on the succession of different car models launched down a mixed-model assembly line. It aims to avoid work overloads at the stations of the line by applying so-called sequencing rules, which restrict the maximu...

In the paper we consider strongly NP-hard flow shop problem with the criterion of minimization of the sum of job’s finishing times. We present the parallel algorithm based on the scatter search method. Obtained results are compared to the best known from the literature. Superlinear speedup has been observed in the parallel calculations.