Optimal scheduling for a single machine to minimize the sum of maximum earliness and tardiness considering idle insert. - Reza Tavakkoli-Moghaddam; Ghasem Moslehi; M. Vasei; Amir Azaron (Appl. Math. Comput., 2005)

A branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert. - Reza Tavakkoli-Moghaddam; Ghasem Moslehi; M. Vasei; Amir Azaron (Appl. Math. Comput., 2006)

Minimizing the number of tardy jobs under piecewise-linear deterioration. - Ghasem Moslehi; Abbasali Jafari (Comput. Ind. Eng., 2010)

Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem. - Ehsan Molaee; Ghasem Moslehi; Mohammad Reisi (Comput. Math. Appl., 2010)

Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint. - Ehsan Molaee; Ghasem Moslehi; Mohammad Reisi (Comput. Math. Appl., 2011)

Minimizing the sum of maximum earliness and maximum tardiness in the single-machine scheduling problem with sequence-dependent setup time. - N. Nekoiemehr; Ghasem Moslehi (J. Oper. Res. Soc., 2011)

Mathematical models for preemptive shop scheduling problems. - Abbas Ebadi; Ghasem Moslehi (Comput. Oper. Res., 2012)

A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties. - Kamran Kianfar; Ghasem Moslehi (Comput. Oper. Res., 2012)

Scheduling linear deteriorating jobs to minimize the number of tardy jobs. - Abbasali Jafari; Ghasem Moslehi (J. Glob. Optim., 2012)

Two-sided assembly line balancing considering the relationships between tasks. - Danial Khorasanian; Seyed Reza Hejazi; Ghasem Moslehi (Comput. Ind. Eng., 2013)

An optimal method for the preemptive job shop scheduling problem. - Abbas Ebadi; Ghasem Moslehi (Comput. Oper. Res., 2013)

Optimizing blocking flow shop scheduling problem with total completion time criterion. - Ghasem Moslehi; Danial Khorasanian (Comput. Oper. Res., 2013)

A note on "Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date". - Kamran Kianfar; Ghasem Moslehi (Discret. Appl. Math., 2013)

Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness. - Mehdi Mahnam; Ghasem Moslehi; Seyyed Mohammad Taghi Fatemi Ghomi (Math. Comput. Model., 2013)

A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion. - Ghasem Moslehi; Danial Khorasanian (Comput. Oper. Res., 2014)

Approximation Algorithms and an FPTAS for the Single Machine Problem with Biased Tardiness Penalty. - Ghasem Moslehi; Kamran Kianfar (J. Appl. Math., 2014)

A hybrid genetic and linear programming algorithm for two-agent order acceptance and scheduling problem. - Mohammad Reisi-Nafchi; Ghasem Moslehi (Appl. Soft Comput., 2015)

A novel metaheuristic algorithm and utility function for QoS based scheduling in user-centric grid systems. - Kamran Kianfar; Ghasem Moslehi; Ramin Yahyapour (J. Supercomput., 2015)

Robust scheduling of parallel machines considering total flow time. - S. Alimoradi; Milad Hematian; Ghasem Moslehi (Comput. Ind. Eng., 2016)

A Lagrangian relaxation algorithm for order acceptance and scheduling problem: a globalised robust optimisation approach. - Saeed Emami; Mohammad Sabbagh; Ghasem Moslehi (Int. J. Comput. Integr. Manuf., 2016)

Minimising the total completion time in a single machine scheduling problem under bimodal flexible periodic availability constraints. - O. Mashkani; Ghasem Moslehi (Int. J. Comput. Integr. Manuf., 2016)

Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption. - Danial Khorasanian; Ghasem Moslehi (Comput. Oper. Res., 2017)

Maximizing the profit in customer's order acceptance and scheduling problem with weighted tardiness penalty. - Somaye Geramipour; Ghasem Moslehi; Mohammad Reisi-Nafchi (J. Oper. Res. Soc., 2017)

The re-planning and scheduling of surgical cases in the operating room department after block release time with resource rescheduling. - Babak Akbarzadeh; Ghasem Moslehi; Mohammad Reisi-Nafchi; Broos Maenhout (Eur. J. Oper. Res., 2019)

A diving heuristic for planning and scheduling surgical cases in the operating room department with nurse re-rostering. - Babak Akbarzadeh; Ghasem Moslehi; Mohammad Reisi-Nafchi; Broos Maenhout (J. Sched., 2020)

Single machine scheduling problem of minimising weighted sum of maximum weighted earliness and weighted number of tardy jobs. - Parvaneh Eghbalpor; Mohammad Reisi-Nafchi; Ghasem Moslehi (Int. J. Manuf. Res., 2021)

The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale. - Maryam Rajaei; Ghasem Moslehi; Mohammad Reisi-Nafchi (Eur. J. Oper. Res., 2022)

Minimising the number of cancellations at the time of a severe lack of postanesthesia care unit beds or nurses. - Danial Khorasanian; Franklin Dexter; Erik Demeulemeester; Ghasem Moslehi (Int. J. Prod. Res., 2022)

Minimizing the weighted sum of maximum earliness and maximum tardiness in a single-agent and two-agent form of a two-machine flow shop scheduling problem. - Vahid Nasrollahi; Ghasem Moslehi; Mohammad Reisi-Nafchi (Oper. Res., 2022)

A relax-and-fix Pareto-based algorithm for a bi-objective vaccine distribution network considering a mix-and-match strategy in pandemics. - Alireza Nikoubin; Mehdi Mahnam; Ghasem Moslehi (Appl. Soft Comput., 2023)

Unrelated parallel machine energy-efficient scheduling considering sequence-dependent setup times and time-of-use electricity tariffs. - Hemen Sanati; Ghasem Moslehi; Mohammad Reisi-Nafchi (EURO J. Comput. Optim., 2023)

Two new mixed-integer programming models for the integrated train formation and shipment path optimization problem. - Pouria Arsalani; Mohammad Reisi-Nafchi; Vahid Dardashti; Ghasem Moslehi (Networks, 2023)

The multiple container loading problem with loading docks. - Maryam Rajaei; Ghasem Moslehi; Mohammad Reisi-Nafchi (Int. Trans. Oper. Res., 2024)