Moslehi Ghasem

Ghasem Moslehi

Information about the author Ghasem Moslehi will soon be added to the site.
Found 10 papers in total
Maximizing the profit in customer’s order acceptance and scheduling problem with weighted tardiness penalty
2017
The customer’s order acceptance and scheduling problem in a single machine...
Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint
2011
In this paper the problem of minimizing maximum earliness on a single machine with an...
Integrating two-agent scheduling and order acceptance problems to maximise total revenue by bounding each agent penalty function
2015
This paper integrates the two‐agent scheduling problem and the order acceptance...
Scheduling linear deteriorating jobs to minimize the number of tardy jobs
2012
In this paper a problem of scheduling a single machine under linear deterioration...
Finding Pareto optima for maximum tardiness, maximum earliness and number of tardy jobs
2012
Just‐in‐time JIT (Just In Time) is an important procedure in...
Mathematical models for preemptive shop scheduling problems
2012
More than half a century has passed since Bowman and Dantzig (1959) introduced their...
Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem
2010
This paper studies the problem of simultaneous minimization of the two criteria of...
A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search
2011
The job-shop scheduling problem is one of the most arduous combinatorial optimization...
A branch-and-bound algorithm to minimise the sum of maximum earliness and tardiness in the single machine
2010
In this paper, we consider the problem of scheduling n jobs on a single machine to...
A branch-and-bound algorithm for minimizing the sum of maximum earliness and tardiness with unequal release times
2009
This article addresses the problem of minimizing the sum of maximum earliness and...
Papers per page: