Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

Batch scheduling problem with due-date and fuzzy precedence relation

Xuesong Li;  Hiroaki Ishii;  Minghao Chen — 2012

Kybernetika

A single-machine batch scheduling problem is investigated. Each job has a positive processing time and due-date. Setup times are assumed to be identical for all batches. All batch sizes cannot exceed a common upper bound. As in many practical situations, jobs have to be subject to flexible precedence constraints. The aim of this paper is to find an optimal batch sequence. The sequence is to minimize the maximal completion time and maximize the minimum value of desirability of the fuzzy precedence....

Chance constrained bottleneck transportation problem with preference of routes

Yue Ge;  Minghao Chen;  Hiroaki Ishii — 2012

Kybernetika

This paper considers a variant of the bottleneck transportation problem. For each supply-demand point pair, the transportation time is an independent random variable. Preference of each route is attached. Our model has two criteria, namely: minimize the transportation time target subject to a chance constraint and maximize the minimal preference among the used routes. Since usually a transportation pattern optimizing two objectives simultaneously does not exist, we define non-domination in this...

Page 1

Download Results (CSV)