In this work, the online printing shop scheduling problem introduced in (Lunardi et al., Mixed Integer Linear Programming and Constraint Models for Online Printing Shop Scheduling Problem, Computers & Operations Research, to appear) is considered. This challenging real problem, that emerged nowadays industry, corresponds a flexible job with sequencing flexibility; it presents several complicati...

Combinatorial auctions are an important e-commerce application where bidders can bid on combinations of items. The problem of selecting the best bids that cover all items, i.e., the Winner Determination Problem (WDP), is NP-hard. In this paper we consider the time constrained variant of this problem, that is the Bid Evaluation Problem (BEP) where temporal windows and precedence constraints are ...

The multimode resource-constrained projectscheduling problem with discounted cash flows (MRCPSPDCF) is important and challenging for project management. As the problem is strongly nondeterministic polynomial-time hard, only a few algorithms exist and the performance is still not satisfying. To design an effective algorithm for the MRCPSPDCF, this paper proposes an ant colony optimization (ACO) ...

The precedence constrained production scheduling problem is the problem of scheduling the performance of jobs over a number of scheduling periods subject to precedence constraints among the jobs. The jobs can each be performed in a number of ways, and it also needs to be determined which processing option (or options) is to be chosen for each job. There can also be arbitrary side constraints am...

In this paper, we consider scheduling of project networks under minimization of total weighted resource tardiness penalty costs. In this problem, we assume constrained resources are renewable and limited to very costly machines and tools which are also used in other projects and are not accessible in all periods of time of a project. In other words, there is a dictated ready date as well as a d...