We study a class of scheduling problems involving the maximumlateness criterion and an element of batching. For all the problemsthat we examine, algorithms appear in the literature which consistof a sorting step to determine an optimal job sequence, followedby a dynamic programming step which...

We model a system which consists of a stream of customers processed through three steps by two resources. The first resource, an investigator, handles the first step, in which she collects information from the customer and decides what work will be done in the second step by the second resource,...

Over the past three decades, practitioners and researchers in engineering and operations sciences have focused on disassembly planning as a way to increase profitability of re-manufacturing, recycling and disposal processes for end-of-life products. An important task in disassembly planning is...

Choosing right Rapid Prototyping technology is not easy, especially for companies inexperienced with that group of manufacturing techniques. Paper summarizes research focused on creating an algorithm for expert system, helping to choose optimal process and determine its parameters for...

We study the problem of how to design a sparse flexible process structure in a balanced and symmetrical production system to match supply with random demand more effectively. Our goal is to provide an optimal design, i.e., the sparsest design, to achieve (1-ε)-optimality relative to the fully...

We consider both branch-and-cut and column generation approaches for the problem of finding a minimum cost assignment of jobs with release dates and deadlines to unrelated parallel machines. Results are presented for several variants both with and without Constraint Programming. Among the...