Search Results - "Kacem, Imed"

Minimizing the maximum lateness for scheduling with release times and job rejection by Kacem, Imed, Kellerer, Hans

“…We study scheduling problems with release times and rejection costs with the objective function of minimizing the maximum lateness. Our main result is a PTAS…”
Get full text

Optimal solutions for online conversion problems with interrelated prices by Schroeder, Pascal, Kacem, Imed

“…We consider various online conversion problems with interrelated prices. The first variant is the online time series search problem with unknown bounds on the…”
Get full text

Preface: Recent advances in multiple objective optimization and goal programming by Kacem, Imed, La Torre, Davide, Masri, Hatem

Get full text

Preface: New trends on combinatorial optimization for network and logistical applications by Kacem, Imed, Kellerer, Hans, Mahjoub, A. Ridha

Get full text

Exact algorithms for scheduling programs with shared tasks by Kacem, Imed, Lucarelli, Giorgio, Nazé, Théo

“…We study a scheduling problem where the jobs we have to perform are composed of one or more tasks. If two jobs sharing a non-empty subset of tasks are…”
Get full text

Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic by Kacem, Imed, Hammadi, Slim, Borne, Pierre

“…Most scheduling problems are complex combinatorial problems and very difficult to solve [ Manage. Sci. 35 (1989) 164; F.S. Hillier, G.J. Lieberman,…”
Get full text

Industry Applications of Computational Intelligence by Dou, Runliang, Chien, Chen-Fu, Kacem, Imed, Hsu, Chia-Yu

Get full text

Recent Advances in Combinatorial Optimization by Xu, Dehua, Yang, Dar-Li, Liu, Ming, Chu, Feng, Kacem, Imed

Get full text

Assignment and Scheduling in Flexible Job-Shops by Hierarchical Optimization by Zribi, N., Kacem, I., El Kamel, A., Borne, P.

“…In this paper, we propose a new hierarchical method for the flexible job-shop scheduling problem (FJSP). This approach is mainly adapted to a job-shop problem…”
Get full text

Competitive difference analysis of the cash management problem with uncertain demands by Schroeder, Pascal, Kacem, Imed

“…•Optimal algorithm for minimizing competitive difference with bounded demands.•Heuristic for minimizing competitive difference with interrelated…”
Get full text

Productivity improvement based on a decision support tool for optimization of constrained delivery problem with time windows by Abdelsadek, Youcef, Kacem, Imed

“…•A new decision support tool for productivity improvement is introduced.•The delivery scheduling is optimized and presented via interactive…”
Get full text

Applications of Optimization Methods to Industrial Engineering Problems by Kacem, Imed

Get full text

An Exact Method for the 2D Guillotine Strip Packing Problem by Bekrar, Abdelghani, Kacem, Imed

“…We consider the two-dimensional strip packing problem with guillotine cuts. The problem consists in packing a set of rectangular items on one strip of width W…”
Get full text

Optimal cash management with uncertain, interrelated and bounded demands by Schroeder, Pascal, Kacem, Imed

“…•The online algorithm BCSID for the cash management problem with interrelated demands.•The proof of competitive ratio and optimality of BCSID.•A heuristic…”
Get full text

A branch-and-bound algorithm for solving the static rebalancing problem in bicycle-sharing systems by Kadri, Ahmed Abdelmoumene, Kacem, Imed, Labadi, Karim

“…•We consider the vehicles scheduling problem in bicycle sharing systems.•We define and formulate a mathematical model to minimize both the operational cost and…”
Get full text

Min–max relative regret for scheduling to minimize maximum lateness by Assayakh, Imad, Kacem, Imed, Lucarelli, Giorgio

“…We study the single machine scheduling problem under uncertain parameters, with the aim of minimizing the maximum lateness. More precisely, the processing…”
Get full text

Approximation Schemes for Minimizing the Maximum Lateness on a Single Machine with Release Times Under Non-availability or Deadline Constraints by Kacem, Imed, Kellerer, Hans

“…In this paper, we consider four single-machine scheduling problems with release times, with the aim of minimizing the maximum lateness. In the first problem we…”
Get full text

Semi-online scheduling on a single machine with unexpected breakdown by Kacem, Imed, Kellerer, Hans

“…In this paper, we consider a single machine scheduling problem where a breakdown period occurs in an online way. Two main objective functions are studied: the…”
Get full text

GUEST EDITORIAL： NEW TRENDS ON SERVICE SYSTEMS AND SERVICE MANAGEMENT by Chu, Chengbin, Kacem, Imed

“…The International Conference on Service Systems and Service Management （ICSSSM06） was held on October 25-27, 2006 in Troyes, France. This conference was…”
Get full text

AN IMPROVED BRANCH-AND-BOUND ALGORITHM TO MINIMIZE THE WEIGHTED FLOWTIME ON IDENTICAL PARALLEL MACHINES WITH FAMILY SETUP TIMES by Bettayeb, Belgacem, Kacem, Imed, Adjallah, Kondo H.

“…This article investigates identical parallel machines scheduling with family setup times. The objective function being the weighted sum of completion times,…”
Get full text