Zouhour Nabli - Academia.edu (original) (raw)
Uploads
Papers by Zouhour Nabli
International Journal of Operational Research, 2018
The purpose of this paper is to evaluate the overall performance of a bi-objective scheduling pro... more The purpose of this paper is to evaluate the overall performance of a bi-objective scheduling problem using a method based on a combination of data envelopment analysis and decision tree. The hybrid approach is applied to the blocking flow shop scheduling problem with both makespan and total tardiness objectives. For this end, we propose two families of three-phase heuristics. In phase one, several constructive heuristics are used to generate initial solutions and in phase two, two improving heuristics are used to generate non-dominated solutions. One of the improving heuristics is based on the makespan criteria and the other one is based on the total tardiness criteria. The non-dominated solutions are then compared using the free disposal hull (FDH) formulation of data envelopment analysis (DEA). The overall performance of the composed heuristics is measured using a decision tree approach.
Advances in Intelligent Systems and Computing, 2018
In this article, we present four heuristics for solving the problem of the hybrid flow shop sched... more In this article, we present four heuristics for solving the problem of the hybrid flow shop scheduling problem denoted HFS with parallel machines at the first stage and two dedicated machines at the second stage. We compare heuristics with lower bounds and upper bounds generated by a mathematical model.
International Journal of Advanced Operations Management, 2015
This paper presents a mathematical model, three heuristics and two lower bounds in order to solve... more This paper presents a mathematical model, three heuristics and two lower bounds in order to solve the hybrid flow shop scheduling problem with parallel machines at the first stage and two dedicated machines at the second stage. Each job is subject to a release date at stage one. The objective is to minimize the makespan.
2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC), 2016
in this article two mathematical models and lower bounds are presented for the hybrid flow shop s... more in this article two mathematical models and lower bounds are presented for the hybrid flow shop scheduling problem noted HFS. We consider me parallel machines at the first stage and two dedicated machines at the second stage. We showed that the performance depends on the choice of the decision variable types.
International Journal of Operational Research, 2018
The purpose of this paper is to evaluate the overall performance of a bi-objective scheduling pro... more The purpose of this paper is to evaluate the overall performance of a bi-objective scheduling problem using a method based on a combination of data envelopment analysis and decision tree. The hybrid approach is applied to the blocking flow shop scheduling problem with both makespan and total tardiness objectives. For this end, we propose two families of three-phase heuristics. In phase one, several constructive heuristics are used to generate initial solutions and in phase two, two improving heuristics are used to generate non-dominated solutions. One of the improving heuristics is based on the makespan criteria and the other one is based on the total tardiness criteria. The non-dominated solutions are then compared using the free disposal hull (FDH) formulation of data envelopment analysis (DEA). The overall performance of the composed heuristics is measured using a decision tree approach.
Advances in Intelligent Systems and Computing, 2018
In this article, we present four heuristics for solving the problem of the hybrid flow shop sched... more In this article, we present four heuristics for solving the problem of the hybrid flow shop scheduling problem denoted HFS with parallel machines at the first stage and two dedicated machines at the second stage. We compare heuristics with lower bounds and upper bounds generated by a mathematical model.
International Journal of Advanced Operations Management, 2015
This paper presents a mathematical model, three heuristics and two lower bounds in order to solve... more This paper presents a mathematical model, three heuristics and two lower bounds in order to solve the hybrid flow shop scheduling problem with parallel machines at the first stage and two dedicated machines at the second stage. Each job is subject to a release date at stage one. The objective is to minimize the makespan.
2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC), 2016
in this article two mathematical models and lower bounds are presented for the hybrid flow shop s... more in this article two mathematical models and lower bounds are presented for the hybrid flow shop scheduling problem noted HFS. We consider me parallel machines at the first stage and two dedicated machines at the second stage. We showed that the performance depends on the choice of the decision variable types.