Anis Gharbi

Orcid: 0000-0001-5658-7259

According to our database1, Anis Gharbi authored at least 27 papers between 2003 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Variable Neighborhood Search for Minimizing the Makespan in a Uniform Parallel Machine Scheduling.
Syst., 2024

Soccer Match Algorithm for Global Optimization: A Contender Metaheuristic.
IEEE Access, 2024

2023
The K Critical Path Sets to Protect in Interdiction Networks Under Limited Defensive Resources.
IEEE Trans. Netw. Serv. Manag., December, 2023

2022
Two-stage no-wait hybrid flow shop with inter-stage flexibility for operating room scheduling.
Comput. Ind. Eng., 2022

2021
Two-stage no-wait hybrid flow shop scheduling with inter-stage flexibility: A mathematical model.
Proceedings of the IEEE International Conference on Networking, Sensing and Control, 2021

2020
A Column Generation-Based Lower Bound for the Minimum Sum Coloring Problem.
IEEE Access, 2020

2019
Enhanced lower bounds and exact procedures for total completion time minimization in a two-machine permutation flowshop with release dates.
Int. Trans. Oper. Res., 2019

2018
A Computational Study of the Two-Machine No-Wait Flow Shop Scheduling Problem Subject to Unequal Release Dates and Non-Availability Constraints.
IEEE Access, 2018

2017
New Efficient Lower Bound for the Hybrid Flow Shop Scheduling Problem With Multiprocessor Tasks.
IEEE Access, 2017

Physician scheduling using goal programming-an application to a large hospital in Saudi Arabia.
Proceedings of the 4th International Conference on Control, 2017

2016
An optimization-based heuristic for the machine reassignment problem.
Ann. Oper. Res., 2016

2014
The Nonpermutation Flowshop Scheduling Problem: Adjustment and Bounding Procedures.
J. Appl. Math., 2014

2013
The two-machine flowshop scheduling problem with sequence-independent setup times: New lower bounding strategies.
Eur. J. Oper. Res., 2013

2010
Polynomial Lower Bounds for the Two-Machine Flowshop Problem with Sequence-Independent Setup Times.
Electron. Notes Discret. Math., 2010

Extending the Single Machine-Based Relaxation Scheme for the Job Shop Scheduling Problem.
Electron. Notes Discret. Math., 2010

Minimizing Expected Attacking Cost in Networks.
Electron. Notes Discret. Math., 2010

Jackson's semi-preemptive scheduling on a single machine.
Comput. Oper. Res., 2010

2009
Hierarchical decision making in production and repair/replacement planning with imperfect repairs under uncertainties.
Eur. J. Oper. Res., 2009

2008
Energetic reasoning revisited: application to parallel machine scheduling.
J. Sched., 2008

2007
Age-dependent production planning and maintenance strategies in unreliable manufacturing systems with lost sale.
Eur. J. Oper. Res., 2007

An approximate decomposition algorithm for scheduling on parallel machines with heads and tails.
Comput. Oper. Res., 2007

2006
Optimal Scheduling of a Two-stage Hybrid Flow Shop.
Math. Methods Oper. Res., 2006

Tight bounds for the identical parallel machine scheduling problem.
Int. Trans. Oper. Res., 2006

2005
Fast lifting procedures for the bin packing problem.
Discret. Optim., 2005

Optimal parallel machines scheduling with availability constraints.
Discret. Appl. Math., 2005

2004
Lower Bounds for Scheduling on Identical Parallel Machines with Heads and Tails.
Ann. Oper. Res., 2004

2003
An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines.
Oper. Res. Lett., 2003


  Loading...