For Better Performance Please Use Chrome or Firefox Web Browser

Dr.Ghasem Moslehi

Department of Industrial and Systems Engineering

Welcome to Dr.Ghasem Moslehi

No front page content has been created yet.

Office : Department of Industrial and Systems Engineering, Isfahan University of Technology, Isfahan, IRAN. 84156-83111 Email : moslehi@iut.ac.ir Phone : +98-313-3915509 Fax : +98-313-3915526 Web Site : http://moslehi.iut.ac.ir

Professor

Research Fields : Sequencing & Scheduling in Manufacturing, Services

Production Planning

Operations Research

Health Care Planning & Scheduling

Teaching

Recent Publications

The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale

OPERATING ROOM SCHEDULING CONSIDERING PATIENT PRIORITIES AND OPERATING ROOM PREFERENCES: A CASE STUDY

Minimizing the number of cancellations at the time of a severe lack of post anesthesia care unit beds or nurses

New integer programming models for slab stack shuffling problems

The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale

A diving heuristic for planning and scheduling surgical cases in the operating room department with nurse re-rostering

Energy-Efficient Scheduling in an Unrelated Parallel-Machine Environment Under Time-Of-Use Electricity Tariffs

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

Single Machine Scheduling Problem of Minimizing Weighted Sum of Maximum Weighted Earliness and Weighted Number of Tardy Jobs

Customer's order acceptance and scheduling to maximise total profit

The re-planning and scheduling of surgical cases in the operating room department after block release time with resource rescheduling

Mathematical Model for Bi-objective Maximal Hub Covering Problem with Periodic Variations of Parameters

Minimizing the Number of Tardy Jobs in Single Machine Scheduling Problem under Bimodal Flexible Periodic Availability Constraints

Exact and heuristic algorithms for minimizing Tardy/Lost penalties on a single machine scheduling problem

Analyses of the phase I postanesthesia care unit baseline capacity and effect of disruptions to its beds or nurse availability on operating room workflow

A two-agent scheduling problem in a two-machine flowshop

Simultaneous scheduling and lot-sizing with earliness/tardiness penalties

Minimizing a General Penalty Function on a Single Machine via Developing Approximation Algorithms and FPTASs

Two-machine flow shop scheduling problem with blocking multi-task flexibility of the first machine and preemption

Maximizing the profit in customer s order acceptance and scheduling problem with weighted tardiness penalty

Minimizing maximum earliness in single-machine scheduling with flexible maintenance time

A Benders decomposition approach for order acceptance and scheduling problem a robust optimization approach

Minimizing the Total Completion Time in a Single Machine Scheduling Problem under Bimodal Flexible Periodic Availability

An approximation algorithm and FPTAS for Tardy/Lost minimization with common due dates on a single machine

A Lagrangian relaxation algorithm for order acceptance and scheduling problem a globalized robust optimization approach

Robust scheduling of parallel machines considering total flow time

A novel metaheuristic algorithm and utility function for QoS based scheduling in user-centric grid systems

Two-agent order acceptance and scheduling to maximize total revenue

Integrating Two-agent Scheduling and Order Acceptance to Maximize Total Revenue and Bounding Each Agent Penalty Function

A hybrid genetic and linear programming algorithm for two-agentorder acceptance and scheduling problem

Minimizing the Number of Tardy Jobs on a Single Machine with an Availability Constraint

A hybrid variable neighborhood search algorithm for limited-buffer permutation flow shop scheduling problem with makespan criterion

Approximation Algorithms and an FPTAS for the Single Machine Problem with Biased Tardiness Penalty

A note on Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date

Optimizing blocking flow shop scheduling problem with total completion time criterion

Two-sided assembly line balancing considering the relationships between tasks

An optimal method for the preemptive job shop scheduling problem

Cockpit Crew Pairing Problem in Airline Scheduling Shortest Path with Resources Constraints Approach

Study of Payment Scheduling Problem to Achieve Client - Contractor Agreement

Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness

An Iterated Greedy Algorithm for Solving the Blocking Flow Shop Scheduling Problem with Total Flow Time Criteria

Scheduling linear deteriorating jobs to minimize the number of tardy jobs

Mathematical models for preemptive shop scheduling problems

Finding Pareto-optima for maximum tardiness maximum earliness and number of tardy jobs

A branch-and-bound algorithm for the single machine scheduling with quadratic earliness and tardiness penalties

Minimizing the sum of maximum earliness and maximum tardiness in single -machine scheduling problem with sequenced-dependent setup time

A Pareto Approach to Multi-objective Flexible Job-Shop Scheduling Problem Using Particle Swarm Optimization and Local Search

Minimizing Maximum Earliness and Number of Tardy Jobs in the Single Machine Scheduling Problem with Availability Constraint

Minimizing the Number of Tardy Jobs and Maximum Earliness in the Single Machine Scheduling Using an Artificial Immune System

A branch and bound algorithm to minimise the sum of maximum earliness and tardiness in the single machine

Minimizing The Number Of Tardy Jobs Under Piecewise-linear Deterioration

Minimizing Maximum Earliness and Number of Tardy Jobs in the Single Machine Scheduling Problem

Technology Incubators in Iran Policies Experiences and Outcomes

A branch and bound algorithm for minimizing the sum of maximum earliness and tardiness with unequal release times

Two machine flow shop scheduling to minimize the sum of maximum earliness and tardiness

A branch and bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert

Optimal scheduling for a single machine to minimize the sum of maximum earliness and tardiness considering idle insert