Morito Susumu

Susumu Morito

Information about the author Susumu Morito will soon be added to the site.
Found 9 papers in total
A two-phase mathematical programming approach to rolling stock circulation
A two-phase mathematical programming approach to rolling stock circulation
2010
This paper considers Rolling Stock Circulation Problem (RSCP) in Japan. RSCP is known...
Stochastic programming problem with fixed charge recourse
Stochastic programming problem with fixed charge recourse
2007
In this paper, we introduce a class of stochastic programming problem with fixed...
A branch and bound approach to two-stage hybrid flow shop scheduling problem with diverging jobs and time overlapping production
A branch and bound approach to two-stage hybrid flow shop scheduling problem with diverging jobs and time overlapping production
1999
We consider a two-stage hybrid flow shop scheduling problem minimizing makespan. The...
Cooperative dispatching – exploiting the flexibility of a flexible manufacturing system by means of incremental optimization
Cooperative dispatching – exploiting the flexibility of a flexible manufacturing system by means of incremental optimization
2001
We present a new control scheme for releasing parts into a flexible manufacturing...
A decomposition approach to two-stage hybrid flow shop scheduling with diverging jobs
A decomposition approach to two-stage hybrid flow shop scheduling with diverging jobs
1998
A two-stage hybrid flow shop associated with process industry is considered, in which...
Minimum directed 1-subtree relaxation for score orienteering problem
Minimum directed 1-subtree relaxation for score orienteering problem
1998
Score orienteering is a variant of the orienteering game where competitors start at a...
Effectiveness of definite schedule optimization under processing time variability: Experimental analysis of job shop scheduling
Effectiveness of definite schedule optimization under processing time variability: Experimental analysis of job shop scheduling
1997
The scheduling problem is often treated as a combinatorial optimization problem based...
Selection of relaxation problems for a class of asymmetric traveling salesman problem instances
Selection of relaxation problems for a class of asymmetric traveling salesman problem instances
1991
It is commonly believed that the use of the assignment problem works well when one...
An algorithm for single constraint maximum collection problem
An algorithm for single constraint maximum collection problem
1988
There are many studies which consider an optimal tour on a given graph including the...
Papers per page: